68 citations · 142 across the 43 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.DM2007★ 2 cited
Estimation of Small s-t Reliabilities in Acyclic Networks
Marco Laumanns, Rico Zenklusen
In the classical s-t network reliability problem a fixed network G is given including two designated vertices s and t (called terminals). The edges are subject to independent rando…
math.CO2007
A tight bound on the collection of edges in MSTs of induced subgraphs
Gregory B. Sorkin, Angelika Steger, Rico Zenklusen
Let be a complete -vertex graph with distinct positive edge weights. We prove that for , the set consisting of the edges of all minimum spanning t…