Edge coloring of bipartite graphs with constraints

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 361-399

  Caragiannis, Ioannis ^a   Kaklamanis, Christos ^a,c   Persiano, Pino ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b UNIVERSITY OF SALERNO   (Italy)

^c Engineering Department   (Greece)

Author keywords

Bipartite graphs; Edge coloring; Perfect matchings

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; PATTERN MATCHING;

BIPARTITE GRAPHS; EDGE COLORING;

GRAPH THEORY;

EID: 0037028424     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00400-X     Document Type: Article

References (12)

1. On edge coloring bipartite graphs
2. On the complexity of timetable and multicommodity flow problems
3. Using Eulerian partitions to edge color bipartite graphs
4. Algorithms for edge coloring bipartite graphs and multigraphs
5. 5/2 algorithm for maximum matchings in bipartite graphs
6. Efficient wavelength routing on directed fiber trees
7. Constrained bipartite edge coloring with applications to wavelength routing
8. Graphok és alkalmazásuk a determinások és a halmazok elméletére
9. Improved access to optical bandwidth in trees
10. Efficient access to optical bandwidth
11. Bipartite edge coloring in O(Δ m) time