Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Vikraman ArvindBireswar DasJohannes KöblerSeinosuke TodaPublished in: FSTTCS (2010)
Keyphrases
- fixed parameter tractable
- vertex set
- np hard
- parameterized complexity
- computational problems
- np complete
- global constraints
- bounded treewidth
- graph theory
- weighted graph
- constraint satisfaction problems
- conjunctive queries
- optimal solution
- integer programming
- approximation algorithms
- special case
- computational complexity
- data integration
- constraint programming
- search algorithm