3471 search results - page 240 / 695 » Obstacle Numbers of Graphs |
135
click to vote
WONS
2005
IEEE
15 years 10 months ago
2005
IEEE
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
162
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
150
click to vote
IPTPS
2004
Springer
15 years 10 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...
126
click to vote
ASAP
2006
IEEE
15 years 9 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...
148
click to vote
CCCG
2007
15 years 6 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 ...