Analysis of approximate algorithms for edge-coloring bipartite graphs

DOI10.1016/0020-0190(95)00013-3zbMath0875.68449OpenAlexW1973917240MaRDI QIDQ673614

Ravi Jain, John Werth

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00013-3

zbMATH Keywords

Parallel processingSchedulingApproximation algorithmsEdge coloringAnalysis of algorithmsParallel I/OParallel data transfers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (2)

Some simple distributed algorithms for sparse networks ⋮ Analysis of approximate algorithms for edge-coloring bipartite graphs

Cites Work

• Analysis of approximate algorithms for edge-coloring bipartite graphs
• Scheduling parallel I/O operations in multiple bus systems
• The greedy algorithm is optimal for on-line edge coloring
• A better than “best possible” algorithm to edge color multigraphs
• Unnamed Item

This page was built for publication: Analysis of approximate algorithms for edge-coloring bipartite graphs