Back to Search
Start Over
FINDING 1-FACTORS IN BIPARTITE REGULAR GRAPHS AND EDGE-COLORING BIPARTITE GRAPHS.
- Source :
-
SIAM Journal on Discrete Mathematics . 2002, Vol. 15 Issue 3, p283-288. 6p. - Publication Year :
- 2002
-
Abstract
- This paper gives a new and faster algorithm to find a 1-factor in a bipartite Δ-regular graph. The time complexity of this algorithm is O(nΔ + n log n log Δ), where n is the number of nodes. This implies an O(n log n log Δ + m log Δ) algorithm to edge-color a bipartite graph with n nodes, in edges, and maximum degree Δ. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
*GRAPH algorithms
*GRAPH theory
*ALGORITHMS
*ALGEBRA
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 15
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 12856372
- Full Text :
- https://doi.org/10.1137/S0895480199351136