Efficient parallel algorithms for edge coloring problems
- 1 March 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (1), 39-52
- https://doi.org/10.1016/0196-6774(87)90026-5
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949