• DocumentCode
    1595496
  • Title

    Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time

  • Author

    Babai, László ; Codenotti, Paolo

  • Author_Institution
    Univ. of Chicago, Chicago, IL
  • fYear
    2008
  • Firstpage
    667
  • Lastpage
    676
  • Abstract
    We give an algorithm to decide isomorphism of hypergraphs of rank k in time exp (Otilde(k2radicn)), where n is the number of vertices. (The rank is the maximum size of edges; the tilde refers to a polylogarithmic factor.) The case of bounded k answers a 24-year-old question and removes an obstacle to improving the worst case-bound for Graph Isomorphism testing. The best previously known bound, even for k = 3, was Cn (Luks 1999).
  • Keywords
    computational complexity; graph theory; isomorphism; exponential time; graph isomorphism testing; hypergraphs; Computer science; Polynomials; Testing; algorithm; graph isomorphism; hypergraph; moderately exponential; permutation groups;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
  • Conference_Location
    Philadelphia, PA
  • ISSN
    0272-5428
  • Print_ISBN
    978-0-7695-3436-7
  • Type

    conf

  • DOI
    10.1109/FOCS.2008.80
  • Filename
    4690999
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1595496