672 search results - page 85 / 135 » Lower-stretch spanning trees |
CPC
1998
13 years 7 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
NETWORKS
2010
13 years 6 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
BMCBI
2010
13 years 7 months ago
2010
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ASIAMS
2007
IEEE
14 years 2 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...