Coloring planar graphs in parallel

DOI10.1016/0196-6774(87)90046-0zbMath0636.68088OpenAlexW1993627687MaRDI QIDQ3776654

Howard J. Karloff, Joan. Boyar

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90046-0

zbMATH Keywords

planar graphsNC algorithmsvertex edge coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (8)

A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ A fast parallel coloring of planar graphs with five colors ⋮ An NC algorithm for Brooks' theorem ⋮ Selection of programme slots of television channels for giving advertisement: a graph theoretic approach ⋮ Colouring perfect planar graphs in parallel ⋮ Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs ⋮ An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach

This page was built for publication: Coloring planar graphs in parallel