Bipartite graph matching for points on a line or a circle
From MaRDI portal
Publication:3742735
DOI10.1016/0196-6774(86)90009-XzbMath0605.68059OpenAlexW2074803434MaRDI QIDQ3742735
Robert A. Melter, Michael Werman, T. Yung Kong, Shmuel Peleg
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90009-x
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The Kantorovich metric for probability measures on the circle, A linear time algorithm for a matching problem on the circle, Transportation distances on the circle, Partition into almost straight trails, FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test, Minimum many-to-many matchings for computing the distance between two sequences, Minimum-weight perfect matching for nonintrinsic distances on the line