Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
William Atherton, Dmitrii V. Pasechnik
TL;DR
This paper presents a counterexample that invalidates a key lemma in a 2008 algorithm for modular decomposition, challenging prior claims of correctness and efficiency.
Contribution
It identifies a flaw in the 2008 ICALP modular decomposition algorithm by providing a counterexample that invalidates its core lemma.
Findings
The lemma in the 2008 paper is incorrect.
The proposed algorithm does not always produce correct results.
The paper challenges the validity of the previous linear-time modular decomposition method.
Abstract
We provide a counterexample to a crucial lemma in the ICALP 2008 paper "Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations", invalidating the algorithm described there.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques