Geometric matching and bottleneck problems
From MaRDI portal
Cites work
- A bottleneck matching problem with edge-crossing constraints
- A data structure for dynamic trees
- A fast maximum flow algorithm
- A Faster Deterministic Maximum Flow Algorithm
- Algorithm design
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Expander-Based Approach to Geometric Optimization
- Approximation algorithms for maximum matchings in geometric intersection graphs
- Bottleneck matching in the plane
- Bottleneck non-crossing matching in the plane
- Can visibility graphs be represented compactly?
- Computational geometry. Algorithms and applications.
- Computational topology for data analysis
- Computational topology. An introduction
- Computing the distance between piecewise-linear bivariate functions
- Geometry helps in bottleneck matching and related problems
- Geometry helps to compare persistence diagrams
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- Improved algorithms for distance selection and related problems
- Max flows in O(nm) time, or better
- Maximum flow and minimum-cost flow in almost-linear time
- Maximum matchings in geometric intersection graphs
- Navigating central path with electrical flows: from flows to matchings, and back
- Perfect matchings in O(n n) time in regular bipartite graphs
- Range searching with efficient hierarchical cuttings
- Stability of persistence diagrams
Cited in
(3)
This page was built for publication: Geometric matching and bottleneck problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895873)
