Fast parallel edge colouring of graphs.

DOI10.1016/S0743-7315(03)00115-1MaRDI QIDQ1414732zbMATH OpenFDO

Authors G. Sajith, Sanjeev Saxena

Publication date 4 December 2003

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

EREW PRAM algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Very fast parallel algorithms for approximate edge coloring
• scientific article; zbMATH DE number 4047152
• scientific article; zbMATH DE number 4049082
• Parallel algorithms for the edge-coloring and edge-coloring update problems
• Efficient parallel algorithms for edge coloring problems

Cited in

(6)

• scientific article; zbMATH DE number 4047152 (Why is no real title available?)
• scientific article; zbMATH DE number 3935077 (Why is no real title available?)
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
• A fast parallel algorithm to color a graph with Δ colors
• Parallel O(log n) time edge-colouring of trees and Halin graphs
• Very fast parallel algorithms for approximate edge coloring

This page was built for publication: Fast parallel edge colouring of graphs.

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