Linear transformation distance for bichromatic matchings

DOI10.1145/2582112.2582151zbMath1395.05131OpenAlexW2031013863MaRDI QIDQ4635538

Alexander Pilz, Oswin Aichholzer, Birgit Vogtenhuber, Luis Barba, Thomas Hackl

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchingsreconfiguration problembichromatic point settransformation graphcompatible matchings

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (3)

Linear transformation distance for bichromatic matchings ⋮ Disjoint compatibility graph of non-crossing matchings of points in convex position ⋮ Bichromatic compatible matchings

This page was built for publication: Linear transformation distance for bichromatic matchings