723 search results - page 23 / 145 » On the hyperbolicity constant in graphs |
135
click to vote
SAGA
2007
Springer
16 years 8 days ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
167
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
259
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
159
click to vote
JGT
2010
15 years 4 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...
160
click to vote
DM
2008
15 years 6 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...