New variants of perfect non-crossing matchings

DOI10.1007/978-3-030-67899-9_12MaRDI QIDQ831710zbMATH OpenOpenAlexFDO

Authors Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier

Publication date 24 March 2022

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

zbMATH Keywords

matchingsnon-crossingperfectbottleneckmonochromaticbichromaticMaxMaxMaxMinMinMaxMinMin

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Non-crossing matchings
• Graphs of non-crossing perfect matchings
• Noncrossing matchings with fixed points
• Perfect matchings with crossings
• Stable noncrossing matchings
• Perfect matchings and extended polymatroid
• Perfect matching and polymatroids
• On an obstruction for perfect matchings
• Non-intersecting perfect matchings in cubic graphs (Extended abstract)
• Perfect matchings of generalized polyomino graphs

Cites work

• scientific article; zbMATH DE number 1582821 (Why is no real title available?)
• scientific article; zbMATH DE number 741010 (Why is no real title available?)
• scientific article; zbMATH DE number 1424290 (Why is no real title available?)
• scientific article; zbMATH DE number 1424307 (Why is no real title available?)
• A bottleneck matching problem with edge-crossing constraints
• Algorithms for ham-sandwich cuts
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• Applications of a semi-dynamic convex hull algorithm
• Bottleneck non-crossing matching in the plane
• Computing fair and bottleneck matchings in geometric graphs
• Computing the extreme distances between two convex polygons
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
• Fast Matching Algorithms for Points on a Polygon
• Faster bottleneck non-crossing matchings of points in convex position
• Geometry Helps in Matching
• Geometry helps in bottleneck matching and related problems
• Improved Grid Map Layout by Point Set Matching
• Long non-crossing configurations in the plane
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Range searching with efficient hierarchical cuttings
• Simplex Range Searching and Its Variants: A Review
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Structural properties of bichromatic non-crossing matchings
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications

Cited in

(1)

• Structural properties of bichromatic non-crossing matchings

This page was built for publication: New variants of perfect non-crossing matchings

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