Join Our Newsletter

136 search results - page 1 / 28» Crossing and Weighted Crossing Number of Near-Planar Graphs |

ALGORITHMICA

2011

12 years 4 months ago
2011

A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...

GD

2008

Springer

12 years 10 months ago
2008

Springer

A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...

DCG

2008

12 years 9 months ago
2008

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...

GD

2006

Springer

13 years 1 months ago
2006

Springer

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...

COMGEO

2011

ACM

12 years 4 months ago
2011

ACM

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...