Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
type: Item
instance of: scholarly article
title: Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
zbMATH Open document ID: 0697.68038
DOI: 10.1007/BF01840403
author: Xin He
published in: Algorithmica
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4143433
zbMATH Keywords: perfect graphs
zbMATH Keywords: 4-coloring algorithm
zbMATH Keywords: planar graphs
zbMATH Keywords: PRAM
MaRDI profile type: Publication
cites work: Q5668821
cites work: Q3097395
cites work: Coloring planar graphs in parallel
cites work: A linear 5-coloring algorithm of planar graphs
cites work: Arboricity and Subgraph Listing Algorithms
cites work: On linear-time algorithms for five-coloring planar graphs
cites work: Q3328583
cites work: Q3783597
cites work: Efficient Planarity Testing
cites work: Coloring planar perfect graphs by decomposition
cites work: Finding a Minimum Circuit in a Graph
cites work: A batching method for coloring planar graphs
cites work: A characterization of perfect graphs
cites work: A fast parallel coloring of planar graphs with five colors
cites work: An O(logn) parallel connectivity algorithm
cites work: Q3785973
cites work: The Strong Perfect Graph Conjecture for Planar Graphs
cites work: An O(N2) algorithm for coloring perfect planar graphs
full work available at URL: https://doi.org/10.1007/bf01840403
OpenAlex ID: W2014864344
description: scientific article; zbMATH DE number 4143433