Approximating modular decomposition is hard

DOI10.1007/978-3-030-39219-2_5zbMath1453.68133OpenAlexW3000817392MaRDI QIDQ779173

Mengchuan Zou, Lalla Mouatadid, Michel A. Habib

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs

This page was built for publication: Approximating modular decomposition is hard