Sciweavers

2283 search results - page 88 / 457
» Bounds of Graph Characteristics
Sort
View
DM
2010
91views more  DM 2010»
13 years 8 months ago
Adjacency posets of planar graphs
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...
Stefan Felsner, Ching Man Li, William T. Trotter
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 3 months ago
Random Walk on Directed Dynamic Graphs
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...
Oksana Denysyuk, Luis Rodrigues
DM
2010
126views more  DM 2010»
13 years 8 months ago
Asymptotic connectivity of hyperbolic planar graphs
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 ...
Patrick Bahls, Michael R. Dipasquale
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 8 months ago
Drawing a Graph in a Hypercube
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...
David R. Wood
EUROPAR
2009
Springer
14 years 18 days ago
Capturing and Visualizing Event Flow Graphs of MPI Applications
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...
Karl Fürlinger, David Skinner