3008 search results - page 6 / 602 » Independence in connected graphs |
SASO
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
COMBINATORICS
2006
13 years 7 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
APPROX
2005
Springer
14 years 28 days ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
COMBINATORICS
2004
13 years 7 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...