A better than "best possible" algorithm to edge color multigraphs

Journal of Algorithms

Volumn 7, Issue 1, 1986, Pages 79-104

  Hochbaum, Dorit S ^a   Nishizeki, Takao ^b   Shmoys, David B ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TOHOKU UNIVERSITY   (Japan)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249042614     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(86)90039-8     Document Type: Article

References (11)

1. On edge coloring bipartite graphs
2. Algorithms for edge coloring bipartite graphs and multigraphs
3. Edge-coloring of multigraphs; Recoloring technique
4. Open shop scheduling to minimize finish time
5. The NP-completeness of edge colourings
6. A theorem on colouring lines of a network
7. On an estimate of the chromatic class of a p-graph