JOURNAL ARTICLE
Approximate constrained bipartite edge coloring
Ioannis CaragiannisA. FerreiraChristos KaklamanisStephane PerennesPino PersianoHervé Rivano
Year: 2004 Journal: Discrete Applied Mathematics Vol: 143 (1-3)Pages: 54-61 Publisher: Elsevier BV
Keywords:
Bipartite graph Mathematics Edge coloring Combinatorics Enhanced Data Rates for GSM Evolution Discrete mathematics Graph Artificial intelligence Computer science
Metrics
1
Cited By
0.40
FWCI (Field Weighted Citation Impact)
11
Refs
0.66
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Scheduling and Timetabling Solutions
Social Sciences → Decision Sciences → Management Science and Operations Research
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
BOOK-CHAPTER
Approximate Constrained Bipartite Edge Coloring
Ioannis CaragiannisAfonso FerreiraChristos KaklamanisStéphane PérennèsPino PersianoHervé Rivano
Lecture notes in computer science Year: 2001 Pages: 21-31
JOURNAL ARTICLE
Analysis of approximate algorithms for edge-coloring bipartite graphs
Journal: Information Processing Letters Year: 1995 Vol: 54 (3)Pages: 163-168
BOOK-CHAPTER
Constrained bipartite edge coloring with applications to wavelength routing
Christos KaklamanisPino PersianoThomas ErlebachKlaus Jansen
Lecture notes in computer science Year: 1997 Pages: 493-504
JOURNAL ARTICLE
An approximate König's theorem for edge-coloring weighted bipartite graphs
Year: 2004 Pages: 398-406
JOURNAL ARTICLE
Edge-Coloring Bipartite Graphs
Journal: Journal of Algorithms Year: 2000 Vol: 34 (2)Pages: 390-396