{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:11:15Z","timestamp":1762323075911},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_41","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"444-455","source":"Crossref","is-referenced-by-count":11,"title":["Enumerating Spanning and Connected Subsets in Graphs and Matroids"],"prefix":"10.1007","author":[{"given":"L.","family":"Khachiyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Boros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Borys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Gurvich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/S0097539794270881","volume":"26","author":"A. Tamura","year":"1997","unstructured":"Tamura, A., Shioura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal on Computing\u00a026(3), 678\u2013692 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/S0895480197324700","volume":"12","author":"J. Bang-Jensen","year":"1999","unstructured":"Bang-Jensen, J., Gabow, H.N., Jord\u00e1n, T., Szigeti, Z.: Edge-connectivity augmentation with partition constraints. SIAM Journal on Discrete Mathematics\u00a012(2), 160\u2013207 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0166-218X(02)00455-9","volume":"131","author":"E. Boros","year":"2003","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics\u00a0131, 255\u2013281 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-25960-2_12","volume-title":"Integer Programming and Combinatorial Optimization","author":"E. Boros","year":"2004","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 152\u2013162. Springer, Heidelberg (2004)"},{"key":"41_CR5","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Coulbourn","year":"1987","unstructured":"Coulbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing\u00a024, 1278\u20131304 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. Fredman","year":"1996","unstructured":"Fredman, M., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021, 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"key":"41_CR8","unstructured":"Ishii, T., Nagamochi, H., Ibaraki, T.: Optimal augmentation to make a graph k-edge-connected and triconnected. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States, pp. 280\u2013289 (1998)"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11602613_17","volume-title":"Algorithms and Computation","author":"L. Khachiyan","year":"2005","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Generating cut conjunctions and bridge avoiding extensions in graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 156\u2013165. Springer, Heidelberg (2005)"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E. Lawler","year":"1980","unstructured":"Lawler, E., Lenstra, J.K., Kan, A.H.G.R.: Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM Journal on Computing\u00a09, 558\u2013565 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming: The State of the Art","author":"L. Lovasz","year":"1983","unstructured":"Lovasz, L.: Submodular functions and convexity. In: Grotschel, M., Bachem, A., Korte, B. (eds.) Mathematical Programming: The State of the Art, New York, pp. 235\u2013257. Springer, Heidelberg (1983)"},{"key":"41_CR12","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"41_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks\u00a05, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(00)00339-5","volume":"117","author":"B. Schwikowski","year":"2002","unstructured":"Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Applied Mathematics\u00a0117, 253\u2013265 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR16","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:55Z","timestamp":1619493415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11841036_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}