{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:26Z","timestamp":1780822166954,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735441","type":"print"},{"value":"9783540735458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_23","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"222-231","source":"Crossref","is-referenced-by-count":9,"title":["Generating Minimal k-Vertex Connected Spanning Subgraphs"],"prefix":"10.1007","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konrad","family":"Borys","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khaled","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Gurvich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabor","family":"Rudolf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"23_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"},{"key":"23_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-6509(08)70096-5","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. Elsevier-North Holland, Amsterdam (1989)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/978-3-540-24698-5_52","volume-title":"LATIN 2004: Theoretical Informatics","author":"E. Boros","year":"2004","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Generating maximal independent sets for hypergraphs with bounded edge-intersections. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 488\u2013498. Springer, Heidelberg (2004)"},{"key":"23_CR4","unstructured":"Cheriyan, J., Kao, M.-Y., Thurimella, R.: Algorithms for parallel k-vertex connectivity and sparse certificates. 22, 157\u2013174 (1993)"},{"key":"23_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":"23_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0207024","volume":"117","author":"H.N. Gabow","year":"1978","unstructured":"Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected trees. SIAM Journal on Computing\u00a0117, 280\u2013287 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, Ch.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"23_CR8","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Enumerating spanning and connected subsets in graphs and matroids. Manuscript."},{"key":"23_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":"23_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":"23_CR11","unstructured":"Matsui, T.: Algorithms for finding all the spanning trees in undirected graphs. Technical report, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Report METR93-08 (1993)"},{"key":"23_CR12","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":"23_CR13","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":"23_CR14","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"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:48Z","timestamp":1619518668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}