Research map / Graph learning / Graph algorithms and clustering
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
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 FaPlexen pivot-based branching instead of GP for maximal k-plex enumeration | FaPlexen · G(100,0.5) k=3 | running time (s): 3248.46 -> 312.94 | Helped |
| use FaPlexen instead of GP on real graph celegans | FaPlexen · celegans k=2 | running time (s): 726.03 -> 2.09 | Helped |
| use CommuPlex (degeneracy-order decomposition plus FaPlexen) instead of D2K for community detection | CommuPlex · Wiki-Vote k=2 q=12 | running time (s): 262.06 -> 121.09 | Helped |
| use CommuPlex instead of D2K on soc-pokec-relationships | CommuPlex · soc-pokec-relationships k=2 q=12 | running time (s): 437.61 -> 5949.84 | Hurt |
| use CommuPlex instead of D2K on soc-Epinions1 hard setting | CommuPlex · soc-Epinions1 k=4 q=30 | running time (s): inf -> 77217.32 | Helped |
Closest papers by meaning
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.88)
- Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better (ICML 2024 · similarity 0.86)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.86)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.85)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.84)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.84)
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.