Research map / Graph learning / Graph algorithms and clustering
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use branch-and-search with reduction rules instead of IPBC | maximum k-plex solver · ERDOS-99-2 (k=5) | running time (s): 653.5 -> 0.02 | Helped |
| use BS instead of GuidedBranching | maximum k-plex solver · GEOM-0 (k=2) | running time (s): 9.73 -> 0.01 | Helped |
| use BS instead of GuidedBranching on dense DIMACS clique graphs | maximum k-plex solver · DIMACS instances | running time (s): 1547.25 -> 0.07 (c-fat500-10); 1.77 -> 33.36 (hamming6-2) | Mixed |
Closest papers by meaning
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.88)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.88)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.87)
- Densest k-Subgraph Mining via a Provably Tight Relaxation (AAAI 2025 · similarity 0.87)
- Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better (ICML 2024 · similarity 0.86)
- Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.