Computing maximum \(k\)-defective cliques in massive graphs

DOI10.1016/j.cor.2020.105131OpenAlexW3096767737MaRDI QIDQ2026994

Yanyan Li

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105131

zbMATH Keywords

branch-and-boundgraph reductionmassive graphsrelaxed cliqueexact search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Fast Cluster Detection in Networks by First Order Optimization

Uses Software

• SNAP
• DIMACS

Cites Work

• Unnamed Item
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• A branch and cut solver for the maximum stable set problem
• Exact exponential algorithms.
• An exact bit-parallel algorithm for the maximum clique problem
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Maximum weight relaxed cliques and Russian doll search revisited
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
• On clique relaxation models in network analysis
• A polyhedral study of the generalized vertex packing problem
• A review on algorithms for maximum clique problems
• Clique Relaxation Models in Social Network Analysis
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations
• Graph Partitioning and Graph Clustering
• Node-and edge-deletion NP-complete problems
• A branch and bound algorithm for the maximum clique problem