Skip to main navigation Skip to search Skip to main content

Parallel coloring of graphs: Two approximate algorithms

  • University of North Texas
  • Department of Computer Science, University of Central Florida

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)147-158
Number of pages12
JournalInternational Journal of Computer Mathematics
Volume27
Issue number3-4
DOIs
StatePublished - Jan 1989
Externally publishedYes

ASJC Scopus Subject Areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Keywords

  • Parallel algorithms
  • graph coloring
  • supercomputing

Fingerprint

Dive into the research topics of 'Parallel coloring of graphs: Two approximate algorithms'. Together they form a unique fingerprint.

Cite this