Maximum matchings in geometric intersection graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7650916
- Maximum matchings of a digraph based on the largest geometric multiplicity
- Maximum bipartite subgraph of geometric intersection graphs
- scientific article; zbMATH DE number 1431747
- Maximum matching in regular and almost regular graphs
- Maximum matchings in regular graphs
- On maximal matchings of connected graphs
- On maximum matchings in almost regular graphs
- Extremal theory for convex matchings in convex geometric graphs
- Algorithms – ESA 2004
Cites work
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 741006 (Why is no real title available?)
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Adding range restriction capability to dynamic data structures
- Algorithms for Reporting and Counting Geometric Intersections
- Algorithms – ESA 2004
- Applications of a Planar Separator Theorem
- Approximating extent measures of points.
- Approximation algorithms for polynomial-expansion and low-density graphs
- Computational geometry. Algorithms and applications.
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Generalized Nested Dissection
- Geometric algorithms for sensor networks
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Geometry helps in bottleneck matching and related problems
- Matrix sparsification and nested dissection over arbitrary fields
- Maximum matching in graphs with an excluded minor
- Maximum matchings in general graphs through randomization
- Maximum matchings in planar graphs via Gaussian elimination
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Ray Shooting and Parametric Search
- Realistic input models for geometric algorithms
- Reduced constants for simple cycle graph separation
- Separators for sphere-packings and nearest neighbor graphs
- The analysis of a nested dissection algorithm
- The complexity of the free space for a robot moving amidst fat obstacles
- Triangles and girth in disk graphs and transmission graphs
- Triangular Factorization and Inversion by Fast Matrix Multiplication
Cited in
(2)
This page was built for publication: Maximum matchings in geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050213)
