Algorithms for edge coloring bipartite graphs

DOI10.1145/800133.804346zbMath1282.68181OpenAlexW2007635679MaRDI QIDQ5402556

Oded Kariv, Harold N. Gabow

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804346

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Asymmetrical multiconnection three‐stage clos networks ⋮ Distributed edge coloration for bipartite networks ⋮ Another look at the degree constrained subgraph problem ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Algorithms for edge coloring bipartite graphs