Using euler partitions to edge color bipartite multigraphs
- 1 December 1976
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 5 (4) , 345-355
- https://doi.org/10.1007/bf00998632
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973