0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A Parallel Graph Coloring Heuristic

      ,
      SIAM Journal on Scientific Computing
      Society for Industrial & Applied Mathematics (SIAM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references7

          • Record: found
          • Abstract: not found
          • Article: not found

          Partitioning Sparse Matrices with Eigenvectors of Graphs

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A Simple Parallel Algorithm for the Maximal Independent Set Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              New methods to color the vertices of a graph

                Bookmark

                Author and article information

                Journal
                SIAM Journal on Scientific Computing
                SIAM J. Sci. Comput.
                Society for Industrial & Applied Mathematics (SIAM)
                1064-8275
                1095-7197
                May 1993
                May 1993
                : 14
                : 3
                : 654-669
                Article
                10.1137/0914041
                cc5c8744-662b-455e-ab5f-07cc6574f90b
                © 1993
                History

                Comments

                Comment on this article