Counting Problems Associated With Steiner Trees In Graphs

DOI10.1137/S0895480194262862MaRDI QIDQ4377433zbMATH OpenFDO

Authors J. Scott Provan, Manoj K. Chari

Publication date 9 February 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480194262862

zbMATH Keywords

countingcutenumerationSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• The edge-disjoing steiner problem in graphs
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• Counting almost minimum cutsets with reliability applications
• Calculating K-Connectedness Reliability Using Steiner Bounds

Cited in

(2)

• Calculating K-Connectedness Reliability Using Steiner Bounds
• The Steiner Problem for Count Matroids

This page was built for publication: Counting Problems Associated With Steiner Trees In Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377433)