scientific article; zbMATH DE number 4047152

MaRDI QIDQ3783598zbMATH OpenFDO

Authors A. Gibbons, Wojciech Rytter

Publication date 1987

zbMATH Keywords

Halin graphoptimal edge-colouringouterplanar graphparallel algorithmspolylog time

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A parallel algorithm for edge-coloring partial k-trees
• Fast parallel edge colouring of graphs.
• scientific article; zbMATH DE number 4076639
• scientific article; zbMATH DE number 4049082
• Efficient parallel algorithms for edge coloring problems
• Very fast parallel algorithms for approximate edge coloring
• Parallel O(log n) time edge-colouring of trees and Halin graphs
• Optimal parallel colouring algorithms for totally decomposable graphs
• Parallel algorithms for the edge-coloring and edge-coloring update problems
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

Cited in

(10)

• Parallel O(log n) time edge-colouring of trees and Halin graphs
• Optimal parallel 3-coloring algorithm for rooted trees and its applications
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
• Fast parallel edge colouring of graphs.
• scientific article; zbMATH DE number 4049082 (Why is no real title available?)
• A fast parallel algorithm to color a graph with Δ colors
• Optimal parallel colouring algorithms for totally decomposable graphs
• scientific article; zbMATH DE number 1759462 (Why is no real title available?)
• Very fast parallel algorithms for approximate edge coloring
• Optimally edge-colouring outerplanar graphs is in NC

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783598)