Analysis of approximate algorithms for edge-coloring bipartite graphs
From MaRDI portal
Publication:673614
DOI10.1016/0020-0190(95)00013-3zbMath0875.68449OpenAlexW1973917240MaRDI QIDQ673614
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
Parallel processingSchedulingApproximation algorithmsEdge coloringAnalysis of algorithmsParallel I/OParallel data transfers
Related Items (2)
Some simple distributed algorithms for sparse networks ⋮ Analysis of approximate algorithms for edge-coloring bipartite graphs
Cites Work
This page was built for publication: Analysis of approximate algorithms for edge-coloring bipartite graphs