Document Open Access Logo

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Authors V. Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2010.327.pdf
  • Filesize: 488 kB
  • 11 pages

Document Identifiers

Subject Classification

Keywords
  • Fixed parameter tractability
  • fpt algorithms
  • graph isomorphism
  • computational complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism} which has running time $2^{O(b)}N^{O(1)}$, where the parameter $b$ 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.

Cite As Get BibTex

V. Arvind, Bireswar Das, Johannes Köbler, and Seinosuke Toda. Colored Hypergraph Isomorphism is Fixed Parameter Tractable. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 327-337, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/LIPIcs.FSTTCS.2010.327

Author Details

V. Arvind
Bireswar Das
Johannes Köbler
Seinosuke Toda
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact