On clique relaxation models in network analysis

2012/11/07 by Jeffrey Pattillo, Nataly Youssef, Sergiy Butenko · 6 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Neural Networks #Complex Network Analysis Techniques #Graph theory and applications

paper · doi:10.1016/j.ejor.2012.10.021

openalex publication_date 2012/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Identifying large robust network clusters via new compact formulations of maximum k-club problems
• Network structure and minimum degree

Cited by

• Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
• Extended formulations for the maximum weighted co-2-plex problem
• A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
• Gate-Based and Annealing-Based Quantum Algorithms for the Maximum K-Plex Problem
• On the Structural Parameterizations of 2-Club with Triangle Constraints
• Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches