• DocumentCode
    3628267
  • Title

    Canonical labeling of regular graphs in linear average time

  • Author

    Ludek Kucera

  • fYear
    1987
  • Firstpage
    271
  • Lastpage
    279
  • Abstract
    An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.
  • Keywords
    "Labeling","Polynomials","Testing","Computer science","Mathematics","Heuristic algorithms","Computational complexity","Partitioning algorithms"
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1987., 28th Annual Symposium on
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0807-2
  • Type

    conf

  • DOI
    10.1109/SFCS.1987.11
  • Filename
    4568280
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3628267