721 search results - page 43 / 145 » Bounds on the k-domination number of a graph |
128
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
119
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
156
click to vote
ISPAN
2002
IEEE
15 years 7 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
101
click to vote
ASPDAC
2010
ACM
15 years 10 hour ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
100
click to vote
COMBINATORICS
2006
15 years 2 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...