On the maximum quasi-clique problem
From MaRDI portal
Publication:1759884
DOI10.1016/j.dam.2012.07.019zbMath1254.05140OpenAlexW2016153078MaRDI QIDQ1759884
Jeffrey Pattillo, Alexander Veremyev, Vladimir L. Boginski, Sergiy I. Butenko
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.019
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
The triangle \(k\)-club problem, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Finding maximum subgraphs with relatively large vertex connectivity, A review on algorithms for maximum clique problems, Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights, Approximating 2-cliques in unit disk graphs, Frequency-driven tabu search for the maximum \(s\)-plex problem, A biased random-key genetic algorithm for the maximum quasi-clique problem, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, LP-based dual bounds for the maximum quasi-clique problem, An opposition-based memetic algorithm for the maximum quasi-clique problem, On atomic cliques in temporal graphs, MIP formulations for induced graph optimization problems: a tutorial, On maximum ratio clique relaxations, 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, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, Computational study of the US stock market evolution: a rank correlation-based network model, Mixed Integer Programming for Searching Maximum Quasi-Bicliques, Multivariate algorithmics for finding cohesive subnetworks, Micro-review synthesis for multi-entity summarization, Dense subgraphs in random graphs, On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs, The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms, An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters, On the maximum small-world subgraph problem, Optimization problems for the maximum \(k\)-plex, Finding groups with maximum betweenness centrality, An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
