A branch-and-bound approach for maximum quasi-cliques
From MaRDI portal
Publication:744705
DOI10.1007/S10479-012-1242-YzbMATH Open1296.90130OpenAlexW2038396396MaRDI QIDQ744705FDOQ744705
Authors: F. Mahdavi Pajouh, Zhuqi Miao, B. Balasundaram 
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1242-y
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Community structure in social and biological networks
- Title not available (Why is that?)
- Mining market data: a network approach
- \(E_{11}\) and M theory
- Clustering and domination in perfect graphs
- Title not available (Why is that?)
- The dense \(k\)-subgraph problem
- A fast algorithm for the maximum clique problem
- Novel approaches for analyzing biological networks
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A graph‐theoretic generalization of the clique concept
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- An exact algorithm for the maximum clique problem
- A graph‐theoretic definition of a sociometric clique†
- Title not available (Why is that?)
Cited In (21)
- Title not available (Why is that?)
- On the maximum small-world subgraph problem
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Micro-review synthesis for multi-entity summarization
- Finding clique clusters with the highest betweenness centrality
- Finding maximum subgraphs with relatively large vertex connectivity
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- Quasi-bicliques: Complexity and Binding Pairs
- Near optimal solutions for maximum quasi-bicliques
- Near optimal solutions for maximum quasi-bicliques
- LP-based dual bounds for the maximum quasi-clique problem
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques
- On finding the community with maximum persistence probability
- A review on algorithms for maximum clique problems
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- An exact algorithm for the maximum quasi‐clique problem
- Multivariate algorithmics for finding cohesive subnetworks
Uses Software
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)
