scispace - formally typeset
Open AccessJournal ArticleDOI

On Edge Coloring Bipartite Graphs

Richard Cole, +1 more
- 01 Nov 1980 - 
- Vol. 11, Iss: 3, pp 540-546
TLDR
The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.
Abstract: 
The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book

Principles and Practices of Interconnection Networks

William J. Dally, +1 more
TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.
Journal ArticleDOI

Efficient algorithms for finding maximum matching in graphs

Zvi Galil
- 01 Mar 1986 - 
TL;DR: The techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs are surveyed.
Journal ArticleDOI

Edge-Coloring Bipartite Multigraphs in $0(E\log D)$ Time

Richard Cole, +2 more
- 21 Sep 1999 - 
TL;DR: It is shown that a minimal edge-coloring of G can be computed in O(E logD time), which follows from an algorithm for finding a matching in a regular bipartite graph in O (E) time.
Book ChapterDOI

Computer-Aided School and University Timetabling: The New Wave

Victor A. Bardadym
TL;DR: A classification is proposed for academic timetabling problems, requirements for the timetables, mathematical models, solution methods, data representation, and interface design, and modern problem solution and software design approaches are represented in connection with the theoretical background and world experience of 35 years.
Journal ArticleDOI

Simulating (logcn)-wise independence in NC

Bonnie Berger, +1 more
- 01 Oct 1991 - 
TL;DR: A general framework for removing randomness from randomized NC algorithms whose analysis uses only polyalgorithmic independence is developed, which can be used to obtain many other NC algorithms, including a better NC edge coloring algorithm.
References
More filters
Book

Graphs and hypergraphs

Claude Berge
Proceedings ArticleDOI

A n5/2 algorithm for maximum matchings in bipartite

John E. Hopcroft, +1 more
TL;DR: In this paper, a bipartite graph with n vertices and m edges was constructed in a number of computation steps proportional to (m+n) n, where n is the number of edges in the graph.