Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Vikraman ArvindBireswar DasJohannes KöblerSeinosuke TodaPublished in: Electron. Colloquium Comput. Complex. (2009)
Keyphrases
- fixed parameter tractable
- vertex set
- np hard
- parameterized complexity
- computational problems
- np complete
- conjunctive queries
- global constraints
- graph theory
- weighted graph
- bounded treewidth
- abstract argumentation
- integer programming
- optimal solution
- random graphs
- special case
- minimum cost
- undirected graph
- approximation algorithms
- knapsack problem
- decision problems
- information extraction