On the maximum quasi-clique problem
From MaRDI portal
Recommendations
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On maximum degree-based -quasi-clique problem: complexity and exact approaches
- LP-based dual bounds for the maximum quasi-clique problem
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- A branch-and-bound approach for maximum quasi-cliques
Cited in
(50)- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- The maximum clique interdiction problem
- Multivariate algorithmics for finding cohesive subnetworks
- Micro-review synthesis for multi-entity summarization
- Dense subgraphs in random graphs
- On the query complexity of clique size and maximum satisfiability
- The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd
- Hardness and tractability of the \(\gamma\)-complete subgraph problem
- On the maxima of Motzkin-Straus programs and cliques of graphs
- Optimization problems for the maximum k-plex
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- 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
- On the maximum small-world subgraph problem
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- The maximum ratio clique problem
- The triangle \(k\)-club problem
- Near optimal solutions for maximum quasi-bicliques
- Computational study of the US stock market evolution: a rank correlation-based network model
- A review on algorithms for maximum clique problems
- Approximating 2-cliques in unit disk graphs
- LP-based dual bounds for the maximum quasi-clique problem
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Finding maximum subgraphs with relatively large vertex connectivity
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- On maximum degree-based -quasi-clique problem: complexity and exact approaches
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
- Finding groups with maximum betweenness centrality
- 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
- On the parameterized complexity of non-hereditary relaxations of clique
- \( \gamma \)-clustering problems: classical and parametrized complexity
- On finding the community with maximum persistence probability
- Finding the maximum subgraph of prescribed strength
- Rank-sparsity decomposition for planted quasi clique recovery
- Ultra-small world detection in networks: subgraphs with prescribed distance distributions
- A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
- Solving the multiobjective quasi-clique problem
- Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems
- A branch-and-bound approach for maximum quasi-cliques
This page was built for publication: On the maximum quasi-clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759884)
