Testing bipartiteness of geometric intersection graphs

  title={Testing bipartiteness of geometric intersection graphs},
  author={David Eppstein},
  journal={ACM Trans. Algorithms},
  • D. Eppstein
  • Published 9 July 2003
  • Mathematics
  • ACM Trans. Algorithms
We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in Rd, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness testing of intersection graphs of a broad class of geometric objects. For unit balls in Rd, connectivity testing has equivalent randomized complexity to construction of Euclidean minimum spanning trees, and for line segments in the plane connectivity testing has… 

Figures from this paper

Spanners for Geometric Intersection Graphs

This paper presents the first algorithm for constructing spanners of ball graphs with support for fast distance queries, and shows that the spanner construction has complexity almost equivalent to the construction of a Euclidean minimum spanning tree.

Spanners for geometric intersection graphs with applications

The first algorithm for constructing spanners of ball graphs is presented, using an efficient subdivision of space to construct a sparse graph having many of the same distance properties as the input ball graph, and the constructed spanners have a small vertex separator decomposition (hereditary).

Shortest paths in intersection graphs of unit disks

Geometric Biplane Graphs I: Maximal Graphs

It is shown that two maximal biplane graphs—in the sense that no edge can be added while staying biplane—may differ in the number of edges, and an efficient algorithm is provided for adding edges to a biplane graph to make it maximal.

Some properties of k-Delaunay and k-Gabriel graphs

Mexican Conference on Discrete Mathematics and Computational Geometry Geometric Biplane Graphs I : Maximal Graphs ∗

We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and can be decomposed into two plane graphs. We

Approximation algorithms for graph problems

This thesis studies approximation algorithms for two fundamental problems arising in graph theory: counting copies of one graph in another graph and estimating distances in geometric graphs and presents algorithms for constructing approximate sparse representations of geometric intersection graphs.

A Coloring Solution to the Edge Crossing Problem

This work defines a "closeness" metric on edges as a combination of distance, angle and crossing, and uses the inverse of this metric to compute a color embedding in the L*a*b* color space and assign "close" edges colors that are perceptually far apart.



Intersection graphs of curves in the plane

Geometric Thickness of Complete Graphs

We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

This work proves that there exists Delta-regular graphs with arbitrarily large geometric thickness, and proves that for all Delta >= 9 and for all large n, there exists a Delta- regular graph with geometric thickness at least c Delta^{1/2} n^{1 /2 - 4/Delta - epsilon}.

Graph Treewidth and Geometric Thickness Parameters

It is shown that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting, and that for graphs of treewidth k, the maximum thickness and the maximum geometric thickness both equal ⌈k/2⌉.

The geometric thickness of low degree graphs

It is proved that the geometric thickness of graphs whose maximum degree is no more than four is two, and an embedding algorithm for graphs with maximum degree three that uses an n x n grid and a more complex algorithm for embedding a graph withmaximum degree four.

Some Simplified NP-Complete Graph Problems

On Coloring Unit Disk Graphs

It is shown that the coloring problem for UD graphs remains NP-complete for any fixed number of colors k≥ 3, and a new 3-approximation algorithm for the problem is presented which is based on network flow and matching techniques.