A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
DOI10.1145/2462356.2480283zbMath1305.05222OpenAlexW1974308542MaRDI QIDQ5174455
Publication date: 17 February 2015
Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2462356.2480283
Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
