A simple matching algorithm for regular bipartite graphs.

DOI10.1016/S0020-0190(02)00273-9zbMath1042.68095OpenAlexW1977306381MaRDI QIDQ1853135

Kazuhisa Makino, Satoru Fujishige, Takashi Takabatake

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00273-9

zbMATH Keywords

Graph algorithmsEdge-coloringBipartite matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Space-Efficient Euler Partition and Bipartite Edge Coloring ⋮ Space-efficient Euler partition and bipartite edge coloring ⋮ A simple algorithm for edge-coloring bipartite multigraphs

Cites Work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• A matching algorithm for regular bipartite graphs
• On Edge Coloring Bipartite Graphs
• Using euler partitions to edge color bipartite multigraphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Edge-Coloring Bipartite Graphs