A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
type: Item
instance of: scholarly article
title: A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
zbMATH Open document ID: 0787.68043
DOI: 10.1016/0020-0190(93)90267-D
author: Ming-Shing Yu
author: C. H. Yang
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 500522
zbMATH Keywords: parallel algorithm
zbMATH Keywords: minimum coloring problem
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: Q3484355
cites work: Parallel Merge Sort
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Parallel Scheduling Algorithms
cites work: Q4198056
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Q3328583
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: Parallel Prefix Computation
cites work: Q3898496
description: scientific article; zbMATH DE number 500522