External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Vikraman Arvind

This author has not been identified. Look up 'Vikraman Arvind' in Google

Roman Nedela

This author has not been identified. Look up 'Roman Nedela' in Google

Ilia Ponomarenko

This author has not been identified. Look up 'Ilia Ponomarenko' in Google

Peter Zeman 0001

This author has not been identified. Look up 'Peter Zeman 0001' in Google
runs on