AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Local Search with Dynamic-Threshold Configuration Checking and Incremental Neighborhood Updating for Maximum k-plex Problem

Peilin Chen, Hai Wan, Shaowei Cai, Jia Li, Haicheng Chen

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 20 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 changedWhereMeasuredEffect
replace SCC with Dynamic-threshold Configuration Checking (ablation)DCCplex · BHOSLIB k=4instances with better max(avg) result: 7(21) vs 0(0)Improved
replace SCC with DCC (ablation)DCCplex · DIMACS k=2instances with better max(avg) result: 3(10) vs 1(1)Improved
replace SCC with DCC (ablation)DCCplex · Massive graphs k=3instances with better max(avg) result: 0(1) vs 0(3)No clear effect
add DINU incremental neighborhood updating (ablation)DCCplex · DIMACS/BHOSLIB (60 instances)search steps per 1000s (speedup ratio): speedup 230 on MANN a81Improved
DCCplex vs FD-TSlocal search for max k-plex · frb100-40 k=4best k-plex size: 170 -> 178Improved
DCCplex vs FD-TSlocal search for max k-plex · brock/san DIMACS instancesbest/average k-plex size: san400 0.7 2 k=2: 33(32.2) -> 32(32)Mixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy