Maximum Matchings in Geometric Intersection Graphs

10/04/2019
by   Édouard Bonnet, et al.
0

Let G be an intersection graph of n geometric objects in the plane. We show that a maximum matching in G can be found in O(ρ^3ω/2n^ω/2) time with high probability, where ρ is the density of the geometric objects and ω>2 is a constant such that n × n matrices can be multiplied in O(n^ω) time. The same result holds for any subgraph of G, as long as a geometric representation is at hand. For this, we combine algebraic methods, namely computing the rank of a matrix via Gaussian elimination, with the fact that geometric intersection graphs have small separators. We also show that in many interesting cases, the maximum matching problem in a general geometric intersection graph can be reduced to the case of bounded density. In particular, a maximum matching in the intersection graph of any family of translates of a convex object in the plane can be found in O(n^ω/2) time with high probability, and a maximum matching in the intersection graph of a family of planar disks with radii in [1, Ψ] can be found in O(Ψ^6log^11 n + Ψ^12 ω n^ω/2) time with high probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2022

Computing list homomorphisms in geometric intersection graphs

A homomorphism from a graph G to a graph H is an edge-preserving mapping...
research
05/25/2018

Invariants of graph drawings in the plane

We present a simplified exposition of some classical and modern results ...
research
11/20/2018

An Isoperimetric Result on High-Dimensional Spheres

We consider an extremal problem for subsets of high-dimensional spheres ...
research
09/09/2019

Maximum Bipartite Subgraph of Geometric Intersection Graphs

We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
research
01/05/2022

Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs

We present a (1- ε)-approximation algorithms for maximum cardinality mat...
research
07/16/2023

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs

We develop a framework for algorithms finding diameter in graphs of boun...
research
10/09/2020

Improving Local Identifiability in Probabilistic Box Embeddings

Geometric embeddings have recently received attention for their natural ...

Please sign up or login with your details

Forgot password? Click here to reset