• DocumentCode
    1293968
  • Title

    NC algorithms for recognizing chordal graphs and k trees

  • Author

    Chandrasekharan, N. ; Iyengar, S. Sitharama

  • Author_Institution
    Dept. of Math. Sci., Clemson Univ., SC, USA
  • Volume
    37
  • Issue
    10
  • fYear
    1988
  • fDate
    10/1/1988 12:00:00 AM
  • Firstpage
    1178
  • Lastpage
    1183
  • Abstract
    The authors present parallel algorithms for recognizing the chordal graphs and k trees. Under the PRAM (parallel random-access-machine) model of computation with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. The algorithms have a better processor bound than an independent result by A. Edenbrandt (1985) for recognizing chordal graphs in parallel using O(n3m) processors
  • Keywords
    graph theory; parallel algorithms; trees (mathematics); NC algorithms; PRAM; chordal graph recognition; k trees; parallel algorithms; Computational modeling; Concurrent computing; Hardware; Parallel algorithms; Particle separators; Phase change random access memory; Polynomials; Terminology; Tree graphs; Writing;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.5979
  • Filename
    5979
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1293968