An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
type: Item
instance of: scholarly article
title: An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
zbMATH Open document ID: 0764.68055
DOI: 10.1016/0020-0190(92)90249-U
author: Ming-Shing Yu
author: C. H. Yang
published in: Information Processing Letters
publication date: 1993-01-04T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 86085
zbMATH Keywords: data structures
zbMATH Keywords: design of algorithms
zbMATH Keywords: parallel algorithm
zbMATH Keywords: domatic partition problem
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: On the domatic number of interval graphs
cites work: Dominating sets and domatic number of circular arc graphs
cites work: Q4163262
cites work: A linear algorithm for the domination number of a tree
cites work: Towards a theory of domination in graphs
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: Domination, independent domination, and duality in strongly chordal graphs
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Q4198056
cites work: Q3328583
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: Parallel Prefix Computation
cites work: The Domatic Number Problem in Interval Graphs
cites work: Linear algorithm for domatic number problem on interval graphs
cites work: Q3898496
description: scientific article; zbMATH DE number 86085