Connected matchings

DOI10.1016/J.COMGEO.2025.102174MaRDI QIDQ6964870zbMATH OpenFDO

Authors Oswin Aichholzer, S. Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup

Publication date 4 July 2025

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2025.102174

zbMATH Keywords

intersection graphmatchings for point setspoint sets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Erd?s problems and related topics of discrete geometry (52C10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• Computational geometry. Algorithms and applications.
• Crossing families
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• Introduction to algorithms.
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• On crossing-families in planar point sets
• Planar point sets determine many pairwise crossing segments
• The rectilinear local crossing number of \(K_{n}\)
• Time bounds for selection
• Two optimization problems for unit disks

This page was built for publication: Connected matchings

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