A branch-and-bound approach for maximum quasi-cliques
From MaRDI portal
(Redirected from Publication:744705)
Recommendations
Cites work
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 2128217 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1265079 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- An exact algorithm for the maximum clique problem
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Clustering and domination in perfect graphs
- Community structure in social and biological networks
- Emergence of Scaling in Random Networks
- Mining market data: a network approach
- Novel approaches for analyzing biological networks
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- The dense \(k\)-subgraph problem
- \(E_{11}\) and M theory
Cited in
(26)- LP-based dual bounds for the maximum quasi-clique problem
- Near optimal solutions for maximum quasi-bicliques
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- Near optimal solutions for maximum quasi-bicliques
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On finding the community with maximum persistence probability
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- An exact algorithm for the maximum quasi‐clique problem
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques
- Finding clique clusters with the highest betweenness centrality
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Quasi-bicliques: Complexity and Binding Pairs
- Multivariate algorithmics for finding cohesive subnetworks
- Finding quasi core with simulated stacked neural networks
- Micro-review synthesis for multi-entity summarization
- On the maximum quasi-clique problem
- On the maximum small-world subgraph problem
- Finding maximum subgraphs with relatively large vertex connectivity
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- A review on algorithms for maximum clique problems
This page was built for publication: A branch-and-bound approach for maximum quasi-cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744705)
