• DocumentCode
    810860
  • Title

    Parallel algorithms for planar graph isomorphism and related problems

  • Author

    JáJá, Joseph ; Kosaraju, S. Rao

  • Author_Institution
    Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
  • Volume
    35
  • Issue
    3
  • fYear
    1988
  • fDate
    3/1/1988 12:00:00 AM
  • Firstpage
    304
  • Lastpage
    311
  • Abstract
    Parallel algorithms for planar graph isomorphism and several related problems are presented. Two models of parallel computation are considered: the CREW-PRAM model and the two-dimensional array of processors. The results include O(√n)-time mesh algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single-function coarsest partitioning problem
  • Keywords
    computational complexity; graph theory; parallel algorithms; 2D processor array; CREW-PRAM model; mesh algorithms; parallel algorithms; parallel computation models; planar graph; planar graph isomorphism; single-function coarsest partitioning problem; triconnected components; two-dimensional array; Automata; Computational modeling; Concurrent computing; Context modeling; Graph theory; Parallel algorithms; Partitioning algorithms; Phase change random access memory; Testing; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.1743
  • Filename
    1743
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=810860