3268 search results - page 222 / 654 » The hub number of a graph |
185
click to vote
IPTPS
2004
Springer
15 years 12 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
145
click to vote
ASAP
2006
IEEE
15 years 10 months ago
2006
IEEE
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close...
175
click to vote
CCCG
2007
15 years 8 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
127
click to vote
IJCAI
2003
15 years 8 months ago
2003
Automated verification is one of the most success ful applications of automated reasoning in com puter science. In automated verification one uses algorithmic techniques to es...
163
click to vote
ENDM
2008
15 years 6 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...