scientific article; zbMATH DE number 1424314
From MaRDI portal
Publication:4945528
zbMath0947.68119MaRDI QIDQ4945528
James Abello, Mauricio G. C. Resende, Panos M. Pardalos
Publication date: 6 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)
Related Items
On the approximability of clique and related maximization problems, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Minimum cost edge blocker clique problem, Algorithmic problems in right-angled Artin groups: complexity and applications, Finding maximum subgraphs with relatively large vertex connectivity, Exact algorithms for the minimum cost vertex blocker clique problem, Why organizational networks in reality do not show scale-free distributions, Scale reduction techniques for computing maximum induced bicliques, Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights, Detecting robust cliques in graphs subject to uncertain edge failures, A variable neighborhood search heuristic for the maximum ratio clique problem, A biased random-key genetic algorithm for the maximum quasi-clique problem, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, An opposition-based memetic algorithm for the maximum quasi-clique problem, Maximum weight relaxed cliques and Russian doll search revisited, Finding clubs in graph classes, Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches, An exact algorithm for the maximum quasi‐clique problem, The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study, Asymptotic bounds for clustering problems in random graphs, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Unnamed Item, Constraint and Satisfiability Reasoning for Graph Coloring, Parsimonious formulations for low-diameter clusters, On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem, Using critical sets to solve the maximum independent set problem, Why Is Maximum Clique Often Easy in Practice?, Dense subgraphs in random graphs, Sequences with good correlation property based on depth and interleaving techniques, Graph signatures: identification and optimization, Statistical analysis of financial networks, Finding quasi core with simulated stacked neural networks, A hybrid heuristic for the maximum clique problem, A study of ACO capabilities for solving the maximum clique problem, Clique-detection models in computational biochemistry and genomics, Potential energy principles in networked systems and their connections to optimization problems on graphs, Mining market data: a network approach, A polyhedral study of the maximum edge subgraph problem, Large-scale clique cover of real-world networks, A branch-and-bound approach for maximum quasi-cliques, An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, Design and Engineering of External Memory Traversal Algorithms for General Graphs, An effective local search for the maximum clique problem, On the maximum small-world subgraph problem, An integer programming approach for finding the most and the least central cliques
Uses Software
