| dc.contributor.author |
Arvind, V. |
|
| dc.contributor.author |
Das, Bireswar |
|
| dc.contributor.author |
Köbler, Johannes |
|
| dc.contributor.author |
Seinosuke, Toda |
|
| dc.contributor.other |
Foundations of Software Technology and Theoretical Computer Science (FSTTCS) |
|
| dc.date.accessioned |
2014-04-22T17:04:12Z |
|
| dc.date.available |
2014-04-22T17:04:12Z |
|
| dc.date.issued |
2010 |
|
| dc.identifier.citation |
Das, Bireswar et al., “Colored Hypergraph Isomorphism is Fixed Parameter Tractable”, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2010. |
en_US |
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/1044 |
|
| dc.description.abstract |
We describe a xed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism
which has running time 2 O (b)NO(1), where the parameter is the maximum size of the color classes of the given hypergraphs and N is the input size. We also describe fpt algorithms
for certain permutation group problems that are used as subroutines in our algorithm. |
en_US |
| dc.description.statementofresponsibility |
by Bireswar Das et al., |
|
| dc.language.iso |
en |
en_US |
| dc.subject |
Fixed parameter tractability |
en_US |
| dc.subject |
Fpt algorithms |
en_US |
| dc.subject |
Graph isomorphism |
en_US |
| dc.subject |
Computational complexity |
en_US |
| dc.title |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable |
en_US |
| dc.type |
Conference Paper |
en_US |