Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)

Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman 0001. Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). In Michael A. Bekos, Michael Kaufmann 0001, editors, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Volume 13453 of Lecture Notes in Computer Science, pages 29-42, Springer, 2022. [doi]

Abstract

Abstract is missing.