An approximate König's theorem for edge-coloring weighted bipartite graphs

DOI10.1145/1007352.1007417zbMATH Open1192.05046OpenAlexW1995055095MaRDI QIDQ3581002FDOQ3581002

Authors: José R. Correa, Michel X. Goemans 

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Recommendations

• Improved Bounds on Nonblocking 3-Stage Clos Networks
• On weighted bipartite edge coloring
• Edge Coloring and Decompositions of Weighted Graphs
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• scientific article; zbMATH DE number 2079420

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)

Cited In (3)

• Improved Bounds on Nonblocking 3-Stage Clos Networks
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)

This page was built for publication: An approximate König's theorem for edge-coloring weighted bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581002)