Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable.
Vikraman ArvindRoman NedelaIlia PonomarenkoPeter ZemanPublished in: CoRR (2021)
Keyphrases
- fixed parameter tractable
- bounded treewidth
- parameterized complexity
- np complete
- graph isomorphism
- graph theory
- computational problems
- vertex set
- np hard
- conjunctive queries
- undirected graph
- global constraints
- boolean functions
- abstract argumentation
- relational learning
- graph theoretic
- decision problems
- optimal solution