How Helpers Hasten h-Relations
- 31 October 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (1) , 86-98
- https://doi.org/10.1006/jagm.2001.1169
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Edge-Coloring Bipartite Multigraphs in O ( E log D ) TimeCombinatorica, 2001
- Edge-Coloring Bipartite GraphsJournal of Algorithms, 2000
- Packet Routing in Fixed-Connection Networks: A SurveyJournal of Parallel and Distributed Computing, 1998
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel ComputersSIAM Journal on Computing, 1997
- Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processorsEuropean Journal of Operational Research, 1996
- A comparison of sorting algorithms for the connection machine CM-2Published by Association for Computing Machinery (ACM) ,1991
- A better than “best possible” algorithm to edge color multigraphsJournal of Algorithms, 1986
- Scheduling File TransfersSIAM Journal on Computing, 1985
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981