Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).
Vikraman ArvindRoman NedelaIlia PonomarenkoPeter ZemanPublished in: WG (2022)
Keyphrases
- extended abstract
- fixed parameter tractable
- bounded treewidth
- parameterized complexity
- graph isomorphism
- np complete
- computational problems
- graph theory
- np hard
- vertex set
- undirected graph
- global constraints
- abstract argumentation
- boolean functions
- conjunctive queries
- graph theoretic
- decision problems
- graph structure
- directed graph
- constraint satisfaction problems