The minimum color sum of bipartite graphs

DOI10.1007/3-540-63165-8_227zbMath1401.68242OpenAlexW1686751345MaRDI QIDQ4572002

Amotz Bar-Noy, Guy Kortsarz

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_227

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Upper bounds for static resource allocation in a distributed system
• Minimum Color Sum of Bipartite Graphs
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: The minimum color sum of bipartite graphs