• DocumentCode
    2405223
  • Title

    A parallel algorithm for colouring graphs

  • Author

    Bhandari, I.S. ; Krishna, C.M. ; Siewiorek, D.P.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Carnegie-Mellon Univ., Pittsburgh, PA, USA
  • fYear
    1988
  • fDate
    13-17 Jun 1988
  • Firstpage
    326
  • Lastpage
    333
  • Abstract
    A simple and effective parallel algorithm to color the nodes of a graph is presented. The algorithm is useful in its own right. It also provides a vehicle to demonstrate the tradeoffs between performance and speed implicit in many parallel algorithms. The algorithm is used when the parallel machine has at least as many processors as there are nodes to color
  • Keywords
    graph colouring; parallel algorithms; performance evaluation; graph colouring; parallel algorithm; performance-speed tradeoffs; Communication system control; Graph theory; Mathematics; Optimizing compilers; Parallel algorithms; Parallel machines; Resource management; Trademarks; Vehicles; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 1988., 8th International Conference on
  • Conference_Location
    San Jose, CA
  • Print_ISBN
    0-8186-0865-X
  • Type

    conf

  • DOI
    10.1109/DCS.1988.12533
  • Filename
    12533
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2405223