{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:52:03Z","timestamp":1743061923974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_9","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"100-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TR.1982.5221285","volume":"31","author":"U Abel","year":"1982","unstructured":"Abel, U., Bicker, R.: Determination of all minimal cut-sets between a vertex pair in an undirected graph. IEEE Trans. Reliab. 31(2), 167\u2013171 (1982)","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/net.3230130210","volume":"13","author":"MO Ball","year":"1983","unstructured":"Ball, M.O., Provan, J.S.: Calculating bounds on reachability and connectedness in stochastic networks. Networks 13(2), 253\u2013278 (1983)","journal-title":"Networks"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1080\/00401706.1970.10488728","volume":"12","author":"M Bellmore","year":"1970","unstructured":"Bellmore, M., Jensen, P.A.: An implicit enumeration scheme for proper cut generation. Technometrics 12(4), 775\u2013788 (1970)","journal-title":"Technometrics"},{"key":"9_CR4","volume-title":"La theorie des graphes","author":"C Berge","year":"1958","unstructured":"Berge, C.: La theorie des graphes. Presses Universitaires de France, Paris (1958)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"TC Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","volume":"5","author":"RE Bixby","year":"1975","unstructured":"Bixby, R.E.: The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds. Networks 5(3), 253\u2013298 (1975)","journal-title":"Networks"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(88)90065-0","volume":"21","author":"TB Brecht","year":"1988","unstructured":"Brecht, T.B., Colbourn, C.J.: Lower bounds on two-terminal network reliability. Discrete Appl. Math. 21(3), 185\u2013198 (1988)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S0895480103427138","volume":"18","author":"LS Chandran","year":"2004","unstructured":"Chandran, L.S., Ram, L.S.: On the number of minimum cuts in a graph. SIAM J. Discrete Math. 18(1), 177\u2013194 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"Shimon Even and Robert Endre Tarjan","year":"1976","unstructured":"Shimon Even and Robert Endre Tarjan: Computing an st-numbering. Theor. Comput. Sci. 2(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR10","first-page":"147","volume":"8","author":"ML Gardner","year":"1985","unstructured":"Gardner, M.L.: Algorithm to aid in the design of large scale networks. Large Scale Syst. 8(2), 147\u2013156 (1985)","journal-title":"Large Scale Syst."},{"key":"9_CR11","volume-title":"Efficient Algorithms for Listing Combinatorial Structures","author":"LA Goldberg","year":"2009","unstructured":"Goldberg, L.A.: Efficient Algorithms for Listing Combinatorial Structures, vol. 5. Cambridge University Press, Cambridge (2009)"},{"issue":"6","key":"9_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(84)90083-X","volume":"2","author":"HW Hamacher","year":"1984","unstructured":"Hamacher, H.W., Picard, J.-C., Queyranne, M.: On finding the K best cuts in a network. Oper. Res. Lett. 2(6), 303\u2013305 (1984)","journal-title":"Oper. Res. Lett."},{"issue":"8","key":"9_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/net.3230240804","volume":"24","author":"H Harada","year":"1994","unstructured":"Harada, H., Sun, Z., Nagamochi, H.: An exact lower bound on the number of cut-sets in multigraphs. Networks 24(8), 429\u2013443 (1994)","journal-title":"Networks"},{"issue":"7","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F Harary","year":"1962","unstructured":"Harary, F.: The maximum connectivity of a graph. Proc. Nat. Acad. Sci. 48(7), 1142\u20131146 (1962)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TR.1987.5222466","volume":"36","author":"GB Jasmon","year":"1987","unstructured":"Jasmon, G.B., Foong, K.W.: A method for evaluating all the minimal cuts of a graph. IEEE Trans. Reliab. 36(5), 539\u2013545 (1987)","journal-title":"IEEE Trans. Reliab."},{"key":"9_CR16","unstructured":"Katona, G.: A theorem for finite sets. In: Theory of Graphs, pp. 187\u2013207 (1968)"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00453-007-9111-9","volume":"51","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Generating cut conjunctions in graphs and related problems. Algorithmica 51(3), 239\u2013263 (2008)","journal-title":"Algorithmica"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume":"10","author":"JB Kruskal","year":"1963","unstructured":"Kruskal, J.B.: The number of simplices in a complex. Math. Optim. Tech. 10, 251\u2013278 (1963)","journal-title":"Math. Optim. Tech."},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/321921.321928","volume":"23","author":"A Martelli","year":"1976","unstructured":"Martelli, A.: A Gaussian elimination algorithm for the enumeration of cut sets in a graph. J. ACM 23(1), 58\u201373 (1976)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01581031","volume":"22","author":"J-C Picard","year":"1982","unstructured":"Picard, J.-C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Math. Program. 22(1), 121\u2013121 (1982)","journal-title":"Math. Program."},{"issue":"9","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/0026-2714(92)90653-3","volume":"32","author":"VC Prasad","year":"1992","unstructured":"Prasad, V.C., Sankar, V., Rao, K.S.P.: Generation of vertex and edge cutsets. Microelectron. Reliab. 32(9), 1291\u20131310 (1992)","journal-title":"Microelectron. Reliab."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/opre.32.3.516","volume":"32","author":"JS Provan","year":"1984","unstructured":"Provan, J.S., Ball, M.O.: Computing network reliability in time polynomial in the number of cuts. Oper. Res. 32(3), 516\u2013526 (1984)","journal-title":"Oper. Res."},{"issue":"4","key":"9_CR23","first-page":"351","volume":"15","author":"JS Provan","year":"1996","unstructured":"Provan, J.S., Shier, D.R.: A paradigm for listing (s, t)-cuts in graphs. Algorithmica 15(4), 351\u2013372 (1996)","journal-title":"Algorithmica"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"Pierre Rosenstiehl and Robert Endre Tarjan","year":"1986","unstructured":"Pierre Rosenstiehl and Robert Endre Tarjan: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/net.3230160203","volume":"16","author":"DR Shier","year":"1986","unstructured":"Shier, D.R., Whited, D.E.: Iterative algorithms for generating minimal cutsets in directed graphs. Networks 16(2), 133\u2013147 (1986)","journal-title":"Networks"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discrete Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9_CR27","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/322217.322220","volume":"27","author":"S Tsukiyama","year":"1980","unstructured":"Tsukiyama, S., Shirakawa, I., Ozaki, H., Ariyoshi, H.: An algorithm to enumerate all cutsets of a graph in linear time per cutset. J. ACM (JACM) 27(4), 619\u2013632 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1109\/24.326430","volume":"43","author":"Y Li","year":"1994","unstructured":"Li, Y., Taha, H.A., Landers, T.L.: A recursive approach for enumerating minimal cutsets in a network. IEEE Trans. Reliab. 43(3), 383\u2013388 (1994)","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"9_CR29","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00453-009-9284-5","volume":"56","author":"L-P Yeh","year":"2010","unstructured":"Yeh, L.-P., Wang, B.-F., Hsin-Hao, S.: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights. Algorithmica 56(3), 297\u2013312 (2010)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:41Z","timestamp":1710336281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}