Parallel O(log n) time edge-colouring of trees and Halin graphs
type: Item
instance of: scholarly article
title: Parallel O(log n) time edge-colouring of trees and Halin graphs
zbMATH Open document ID: 0652.68084
DOI: 10.1016/0020-0190(88)90080-4
author: A. Gibbons
author: Amos Israeli
author: Wojciech Rytter
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
full work available at URL: WRAP cs-rr-105.pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4064515
zbMATH Keywords: parallel computation
zbMATH Keywords: edge-colouring
zbMATH Keywords: trees
zbMATH Keywords: PRAM
zbMATH Keywords: Halin graphs
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
OpenAlex ID: W2042837269
cites work: Q3735725
cites work: On the chromatic index of outerplanar graphs
cites work: Q3853641
cites work: Parallelism in random access machines
cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Parallel Algorithms in Graph Theory: Planarity Testing
cites work: A fast parallel algorithm for routing in permutation networks
cites work: Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
cites work: Q3343454
cites work: Q3322145
cites work: An Efficient Parallel Biconnectivity Algorithm
description: scientific article; zbMATH DE number 4064515