scientific article; zbMATH DE number 7650916

DOI10.4230/LIPICS.STACS.2020.31MaRDI QIDQ5874304zbMATH OpenFDO

Authors Édouard Bonnet, S. Cabello, Wolfgang Mulzer

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1910.02123

zbMATH Keywords

computational geometrydisk graphgeometric intersection graphmaximum matchingunit-disk graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
• A geometric theory for hypergraph matching
• Maximum matchings in geometric intersection graphs
• Bottleneck matching in the plane

This page was built for publication:

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