650 search results - page 36 / 130 » Positive graphs |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...
UAI
1996
14 years 11 months ago
1996
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
107
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...