Coloring permutation graphs in parallel
type: Item
instance of: scholarly article
title: Coloring permutation graphs in parallel
zbMATH Open document ID: 1002.68514
DOI: 10.1016/S0166-218X(01)00289-X
author: Stavros D. Nikolopoulos
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C17
zbMATH DE Number: 1792321
zbMATH Keywords: coloring
zbMATH Keywords: coloring permutation graphs
zbMATH Keywords: CREW PRAM model
zbMATH Keywords: coloring-permutation tree
MaRDI profile type: Publication
cites work: Q4948732
cites work: Finding a minimum independent dominating set in a permutation graph
cites work: Optimal bounds for decision problems on the CRCW PRAM
cites work: On domination problems for permutation and other graphs
cites work: Domination in permutation graphs
cites work: Q3328583
cites work: Q3477945
cites work: Q4023519
cites work: 25 pretty graph colouring problems
cites work: Q3732972
cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
cites work: Q4016531
cites work: On the performance of the first-fit coloring algorithm on permutation graphs
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Q4855565
cites work: On Comparability and Permutation Graphs
cites work: Bipartite permutation graphs
cites work: Decomposing a set of points into chains, with applications to permutation and circle graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: Parallel algorithms for permutation graphs
cites work: Generate all maximal independent sets in permutation graphs
description: scientific article; zbMATH DE number 1792321