JOURNAL ARTICLE
Another Simple Algorithm for Edge-Coloring Bipartite Graphs
Year: 2005 Journal: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences Vol: E88-A (5)Pages: 1303-1304 Publisher: Institute of Electronics, Information and Communication Engineers
Abstract
A new edge-coloring algorithm for bipartite graphs is presented. This algorithm, based on the framework of the O(mlogd + (m/d)log(m/d)log d) algorithm by Makino--Takabatake--Fujishige and the O(mlogm) one by Alon, finds an optimal edge-coloring of a bipartite graph with m edges and maximum degree d in O(mlogd + (m/d)log(m/d)) time. This algorithm does not require elaborate data structures, which the best known O(mlogd) algorithm due to Cole--Ost--Schirra depends on.
Keywords:
Bipartite graph Edge coloring Combinatorics Enhanced Data Rates for GSM Evolution Simple (philosophy) Mathematics Algorithm Graph Discrete mathematics Computer science Line graph Graph power Artificial intelligence
Metrics
2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.17
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Related Documents
JOURNAL ARTICLE
Edge-Coloring Bipartite Graphs
Journal: Journal of Algorithms Year: 2000 Vol: 34 (2)Pages: 390-396
JOURNAL ARTICLE
On Edge Coloring Bipartite Graphs
Journal: SIAM Journal on Computing Year: 1982 Vol: 11 (3)Pages: 540-546
JOURNAL ARTICLE
Edge coloring nearly bipartite graphs
Journal: Operations Research Letters Year: 1999 Vol: 24 (1-2)Pages: 11-14
JOURNAL ARTICLE
A simple algorithm for edge-coloring bipartite multigraphs
Journal: Information Processing Letters Year: 2003 Vol: 85 (6)Pages: 301-302