scientific article

zbMATH Open0642.68124MaRDI QIDQ3783598

W. Rytter, A. Gibbons

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel algorithmsouterplanar graphHalin graphpolylog timeoptimal edge-colouring

Mathematics Subject Classification ID

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

Related Items (3)

Optimally edge-colouring outerplanar graphs is in NC ⋮ A fast parallel algorithm to color a graph with Δ colors ⋮ Very fast parallel algorithms for approximate edge coloring

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Parallel O(log n) time edge-colouring of trees and Halin graphs 👍 👎
• Fast parallel edge colouring of graphs. 👍 👎
• Parallel algorithms for the edge-coloring and edge-coloring update problems 👍 👎
• Efficient parallel algorithms for edge coloring problems 👍 👎
• Optimal parallel colouring algorithms for totally decomposable graphs 👍 👎
• A parallel algorithm for edge-coloring partial k-trees 👍 👎
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees 👍 👎
• Very fast parallel algorithms for approximate edge coloring 👍 👎

This page was built for publication: