Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Vikraman ArvindBireswar DasJohannes KöblerSeinosuke TodaPublished in: Algorithmica (2015)
Keyphrases
- fixed parameter tractable
- vertex set
- np hard
- parameterized complexity
- computational problems
- np complete
- global constraints
- graph theory
- bounded treewidth
- approximation algorithms
- conjunctive queries
- special case
- computational complexity
- random graphs
- optimal solution
- integer programming
- database
- weighted graph
- undirected graph
- state space
- lower bound
- abstract argumentation