Sciweavers

FSTTCS
2010
Springer
13 years 9 months ago
Colored Hypergraph Isomorphism is Fixed Parameter Tractable
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
Vikraman Arvind, Bireswar Das, Johannes Köble...