Approximate constrained bipartite edge coloring

Authors:
Ioannis Caragiannis;Afonso Ferreira;Christos Kaklamanis;Stephane Perennes;Pino Persiano;Herve Rivano
Affiliations:
Computer Technology Institute, Dept. of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;MASCOTTE Project, CNRS, I3S & INRIA, Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia Antipolis Cedex, France;Computer Technology Institute, Dept. of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;MASCOTTE Project, CNRS, I3S & INRIA, Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia Antipolis Cedex, France;Dipartimento di Informatica ed Appl., Università di Salerno, 84081 Baronissi, Italy;MASCOTTE Project, CNRS, I3S & INRIA, Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia Antipolis Cedex, France and France Telecom Recherche & Development, 905 rue A. Einstein, F-069 ...
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 8
Cited 0

Randomized algorithms

Randomized algorithms
Bipartite Edge Coloring in $O(\Delta m)$ Time

SIAM Journal on Computing
Edge coloring of bipartite graphs with constraints

Theoretical Computer Science
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Efficient access to optical bandwidth

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems (integer programming)

Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems (integer programming)
Graphs and Hypergraphs

Graphs and Hypergraphs
NP completeness of the edge precoloring extension problem on bipartite graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm ...