{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:38:26Z","timestamp":1787319506687,"version":"3.56.0"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[1997,8]]},"abstract":"<jats:p>This paper considers counting problems associated with K-spanning and K-disconnecting sets for a specified terminal set K in an undirected graph G. In particular, we consider the problems of computing the number of Steiner trees and minK-cuts for G, as well as K-spanning and K-disconnecting sets of cardinality close to the minimum values. Among other things, these numbers are critical to the efficient approximation of K-connected reliability measures in stochastic networks. Although the counting problems considered in this paper are NP-hard in general, a large number of methods for finding shortest paths, min cuts, and Steiner trees in graphs can be extended to efficiently countK-spanning and K-disconnecting sets in important special cases.<\/jats:p>","DOI":"10.1137\/s0895480194262862","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"436-446","source":"Crossref","is-referenced-by-count":1,"title":["Counting Problems Associated With Steiner Trees In Graphs"],"prefix":"10.1137","volume":"10","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manoj K.","family":"Chari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,1]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130210"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.3.253"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.4.905"},{"key":"R4","volume-title":"The combinatorics of network reliability","author":"Colbourn Charles","year":"1987"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.4.634"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908632"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010203"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0605038"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120902"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180108"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/s004539900020"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592076"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002449X"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895480194262862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:48:42Z","timestamp":1787316522000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895480194262862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["10.1137\/S0895480194262862"],"URL":"https:\/\/doi.org\/10.1137\/s0895480194262862","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}