Bipartite edge coloring in O(Δm) time

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 841-846

  Schrijver, Alexander ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Bipartite; Complexity; Edge coloring; Matching; Perfect; Timetabling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS;

BIPARTITE GRAPH; EDGE COLORING;

GRAPH THEORY;

EID: 0032266933     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796299266     Document Type: Article

References (11)

1. R. COLE AND J. HOPCROFT, On edge coloring bipartite graphs, SIAM J. Comput., 11 (1982), pp. 540-546.
2. J. CSIMA AND L. LOVÁSZ, A matching algorithm for regular bipartite graphs, Discrete Appl. Math., 35 (1992), pp. 197-203.
3. S. EVEN, A. ITAI, AND A. SHAMIR, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput., 5 (1976), pp. 691-703.
4. H. N. GABOW, Using Euler partitions to edge color bipartite multigraphs, Internat. J. Comput. Inform. Sci., 5 (1976), pp. 345-355.
5. H. N. GABOW AND O. KARIV, Algorithms for edge coloring bipartite graphs, in Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, 10th STOC, San Diego, CA, May 1-3, 1978, Association for Computing Machinery, New York, 1978, pp. 184-192.
6. H. N. GABOW AND O. KARIV, Algorithms for edge coloring bipartite graphs and multigraphs, SIAM J. Comput., 11 (1982), pp. 117-129.
7. I. G. HOLYER, The NP-completeness of edge-colouring, SIAM J. Comput., 10 (1981), pp. 718-720.
8. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225-231.
9. D. KÖNIG, Graphok és alkalmázdsuk a determinánsok és a halmazok elméletére, Mathematikai és Természettudományi Értesitö, 34 (1916), pp. 104-119 (in Hungarian);
10. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77 (1916), pp. 453-465 (in German).
11. A. SCHRIJVER, On the number of edge-colourings of regular bipartite graphs, Discrete Math., 38 (1982), pp. 297-301.