684 search results - page 74 / 137 » On embedding well-separable graphs |
126
click to vote
RSA
2011
14 years 11 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
121
click to vote
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
142
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
Functional verification is widely acknowledged as a major bottleneck in microprocessor design. While early work on specification driven functional test program generation has prop...
144
Voted
FORMATS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
119
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...