584 search results - page 25 / 117 » On the Number of Halving Planes |
JAL
2006
14 years 9 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
GD
2006
Springer
15 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...
101
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
JCT
2007
14 years 9 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
JGT
2010
14 years 8 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...