๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Low-connectivity network design on series-parallel graphs

โœ Scribed by S. Raghavan

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
186 KB
Volume
43
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The most likely path on series-parallel
The most likely path on series-parallel networks
โœ Daniel Reich; Leo Lopes ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB

## Abstract In this article, we present a stochastic shortest path problem that we refer to as the Most Likely Path Problem (MLPP). We demonstrate that optimal solutions to the MLPP are not composed of optimal subpaths, which limits the computational tractability of exact solution methods. On serie

On low bound of degree sequences of span
On low bound of degree sequences of spanning trees inK-edge-connected graphs
โœ Zhenhong, Liu; Baoguang, Xu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 257 KB ๐Ÿ‘ 3 views

[โ€ข] is a lower integer form and ฮฑ depends on k. We show that every k-edge-connected graph with k โ‰ฅ 2, has a d k -tree, and ฮฑ = 1 for k = 2, ฮฑ = 2 for k โ‰ฅ 3.