275 search results - page 4 / 55 » Bounding the Number of Edges in Permutation Graphs |
155
click to vote
ENDM
2008
15 years 5 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
147
click to vote
CCCG
1997
15 years 7 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
169
click to vote
ALGORITHMICA
2011
15 years 21 days 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...
161
click to vote
CORR
2011
Springer
15 years 20 days ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
159
click to vote
IPL
2000
15 years 5 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...