1729 search results - page 78 / 346 » Bound Graph Polysemy |
113
click to vote
DM
2010
15 years 5 months ago
2010
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimensio...
179
click to vote
CORR
2011
Springer
14 years 12 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
113
click to vote
DM
2010
15 years 5 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
133
click to vote
COMBINATORICS
2006
15 years 5 months ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
184
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...