{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T14:10:04Z","timestamp":1737123004715,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_25","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"220-229","source":"Crossref","is-referenced-by-count":0,"title":["On the Number of Minimum Cuts in a Graph"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]},{"given":"L. Shankar","family":"Ram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","volume":"5","author":"R.E. Bixby","year":"1975","unstructured":"R.E. Bixby, The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-bonds. Networks, Vol.5, (1975) 253\u2013298.","journal-title":"Networks"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TR.1986.4335424","volume":"R-35","author":"F.T. Boesch","year":"1986","unstructured":"F.T. Boesch, Synthesis Of Reliable Networks \u2014 A Survey. IEEE Transactions On Reliability, vol R-35, (1986) 240\u2013246.","journal-title":"IEEE Transactions On Reliability"},{"key":"25_CR3","volume-title":"Extremal Graph Theory","author":"B. Bollabos","year":"1978","unstructured":"B. Bollabos, Extremal Graph Theory. Academic Press, London, 1978."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","volume":"5","author":"M.O. Ball","year":"1975","unstructured":"M.O. Ball, J.S. Provan, Calculating bounds on reachability and connectedness in stochastic networks. Networks, vol 5, (1975) 253\u2013298.","journal-title":"Networks"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"M.O. Ball","year":"1983","unstructured":"M.O. Ball, J.S. Provan, The Complexity Of Counting Cuts And Of Computing The Probability That A Graph Is Connected. SIAM Journal of Computing, 12, (1983) 777\u2013788.","journal-title":"SIAM Journal of Computing"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/opre.32.3.516","volume":"32","author":"M.O. Ball","year":"1984","unstructured":"M.O. Ball, J.S. Provan, Computing Network Reliability In Time Polynomial In The Number Of Cuts. Operations Research, 32, (1984) 516\u2013521.","journal-title":"Operations Research"},{"key":"25_CR7","first-page":"290","volume-title":"Studies in Discrete Optimization","author":"E.A. Dinits","year":"1976","unstructured":"E.A. Dinits, A.V. Karzanov, M.V. Lomosonov, On the Structure of a Family of Minimal Weighted Cuts in a Graph. Studies in Discrete Optimization [In Russian], A.A. Friedman (Ed), Nauka, Moscow (1976) 290\u2013306."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, A Matroid Approach To Finding Edge Connectivity And Packing Arborescences. Proceedings Of 23rd Annual ACM-SIAM Symposium On Theory Of Computing, (1991) 112\u2013122.","DOI":"10.1145\/103418.103436"},{"key":"25_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory. Addison-Wesley Reading, MA, 1969."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1999.1039","volume":"33","author":"L. Fleischer","year":"1999","unstructured":"Lisa Fleischer, Building Chain And Cactus Representations Of All Minimum Cuts From Hao\u2014Orlin In The Same Asymptotic Run Time. Journal Of Algorithms, 33, (1999) 51\u201372.","journal-title":"Journal Of Algorithms"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"D.R. Karger, Random Sampling In Cut, Flow and Network Design Problems. In Proceedings Of 6th Annual ACM-SIAM Symposium On Discrete Algorithms, (1995), 648\u2013657.","DOI":"10.1145\/195058.195422"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0166-218X(95)00043-Q","volume":"65","author":"J. Lehel","year":"1996","unstructured":"Jeno Lehel, Frederic Maffray, Myriam Preissmann, Graphs With Largest Number Of Minimum Cuts. Discrete Applied Mathematics, 65, (1996) 387\u2013407.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR13","unstructured":"A. Kanevsky, Graphs With Odd And Even Edge Connectivity Are Inherently Different. Tech. report, TAMU-89-10, June 1989."},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/S0895480194271323","volume":"10","author":"H. Nagamochi","year":"1997","unstructured":"H. Nagamochi, K. Nishimura, T. Ibaraki, Computing All Small Cuts In An Undirected Network. SIAM Journal Of Discrete Math, 10(3), (1997) 469\u2013481.","journal-title":"SIAM Journal Of Discrete Math"},{"key":"25_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0028269","volume-title":"Workshop On Algorithms and Data structures","author":"D. Naor","year":"1991","unstructured":"D. Naor, Vijay. V. Vazirani, Representing and Enumerating Edge Connectivity Cuts in RNC Workshop On Algorithms and Data structures (1991) LNCS 519 273\u2013285."},{"key":"25_CR16","first-page":"26","volume":"R-35","author":"J.S. Provan","year":"1986","unstructured":"J.S. Provan, Bounds On The Reliability Of Networks. IEEE Transactions On Reliability, R-35, (1986) 26\u2013268.","journal-title":"IEEE Transactions On Reliability"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.C. Picard","year":"1980","unstructured":"J.C. Picard, M. Queyranne, On The Structure Of All Minimum Cuts In A Network And Applications. Mathematical programming Study, 13, (1980) 8\u201316.","journal-title":"Mathematical programming Study"},{"key":"25_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-55719-9_88","volume-title":"Suboptimal Cuts: Their Enumeration, Weight, And Number","author":"V.V. Vazirani","year":"1992","unstructured":"V.V. Vazirani and M. Yannakakis, Suboptimal Cuts: Their Enumeration, Weight, And Number. Lecture Notes in Computer Science, 623, Springer-Verlag, (1992) 366\u2013377."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(96)00079-8","volume":"59","author":"M.R. Henzinger","year":"1996","unstructured":"M.R. Henzinger, D.P. Williamson, On The Number Of Small Cuts. Information Processing Letters, 59, (1996), 41\u201344.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:32:45Z","timestamp":1737037965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}