2000 character limit reached
Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
Published 22 Apr 2024 in cs.DS and math.CO | (2404.14049v1)
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.
- William Atherton “Implementing Linear-time Modular Decomposition in SageMath” 3rd year project dissertation, supervised by D. Pasechnik, 2023 Department of Computer Science, Oxford University
- “A recursive linear time modular decomposition algorithm via LexBFS”, 2024 arXiv:0710.3901 [cs.DM]
- T. Gallai “Transitiv orientierbare Graphen” In Acta Math. Acad. Sci. Hung. 18, 1967, pp. 25–66 DOI: 10.1007/BF02020961
- “A survey of the algorithmic aspects of modular decomposition” In Computer Science Review 4.1, 2010, pp. 41–59 DOI: j.cosrev.2010.01.001
- Marc Tedder “Homepage with a link to Java code” The page was removed in Nov. 2023, a copy is in [8]. A copy of the code, retrieved earlier, is included here., 2008 URL: https://web.archive.org/web/20231117180003/https://www.cs.toronto.edu/~mtedder/
- “A recursive linear time modular decomposition algorithm via LexBFS”, 2008 arXiv:0710.3901v2 [cs.DM]
- “Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations” In Automata, Languages and Programming Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp. 634–645 DOI: 10.1007/978-3-540-70575-8˙52
- “Archive of M. Tedder’s Java code for [7]” URL: https://github.com/dimpase/MDTreeJavacode
- The SageMath Developers “SageMath, the Sage Mathematics Software System”, 2024 DOI: 10.5281/zenodo.8042260
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.