Flip distance to some plane configurations

DOI10.4230/LIPICS.SWAT.2018.11zbMATH Open1477.05058OpenAlexW2805404443MaRDI QIDQ5116475FDOQ5116475

Authors: Ahmad Biniaz, Anil Maheshwari, Michiel Smid 

Publication date: 25 August 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/swat/swat2018.html#BiniazMS18

Recommendations

• Flip distance to some plane configurations
• On flips in planar matchings
• Flip distance is in FPT time \(O(n+ k \cdot c^k)\)

zbMATH Keywords

spanning treesperfect matchingsflip distancenon-crossing edges

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A bottleneck matching problem with edge-crossing constraints
• A history of flips in combinatorial triangulations
• Bichromatic compatible matchings
• Compatible spanning trees
• Cutting dense point sets in half
• Disjoint compatibility graph of non-crossing matchings of points in convex position
• Disjoint compatible geometric matchings
• Flipping edges in triangulations
• Flips in planar graphs
• Lines, line-point incidences and crossing families in dense sets
• Nearest neighbor queries in metric spaces
• Non-crossing matchings of points with geometric objects
• The Number of Flips Required to Obtain Non-crossing Convex Cycles
• Transforming triangulations

Cited In (3)

• On flips in planar matchings
• A note on the flip distance between non-crossing spanning trees
• Flip distance to some plane configurations

This page was built for publication: Flip distance to some plane configurations

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