4865 search results - page 505 / 973 » The Complexity of Graph Connectivity |
202
click to vote
TON
2008
15 years 7 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
216
click to vote
TVCG
2008
15 years 7 months ago
2008
Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the i...
178
click to vote
ARSCOM
1998
15 years 6 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
221
click to vote
SIAMDM
2010
15 years 5 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
228
click to vote
IMCSIT
2010
15 years 5 months ago
2010
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...