{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:23Z","timestamp":1725663443605},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549673"},{"type":"electronic","value":"9783540466123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54967-6_76","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:21:51Z","timestamp":1330194111000},"page":"288-306","source":"Crossref","is-referenced-by-count":5,"title":["A fast algorithm for the principal partition of a graph"],"prefix":"10.1007","author":[{"given":"Sachin","family":"Patkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Minimum Partition of a Matroid into independent subsets, J. Res. National Bureau of Standards, vol. 69B, 1965, pp. 67\u201372.","journal-title":"J. Res. National Bureau of Standards"},{"key":"20_CR2","first-page":"186","volume":"26","author":"H. Imai","year":"1983","unstructured":"Imai, H.: Network flow algorithms for lower truncated transversal polymatroids, 31. of the Op. Research Society of Japan, vol. 26, 1983, pp. 186\u2013210.","journal-title":"31. of the Op. Research Society of Japan"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1111\/j.1749-6632.1979.tb32805.x","volume":"319","author":"M. Iri","year":"1979","unstructured":"Iri, M.: A review of recent work in Japan on principal partition of matroids and their applications, Annals of New York Academy of Sciences, vol 319, 1979, pp.306\u2013319.","journal-title":"Annals of New York Academy of Sciences"},{"key":"20_CR4","unstructured":"Iri, M.: Application of matroid theory to engineering systems problems, Proceedings of the Sixth Conference on Probability Theory, (Sept.1979: Bereanu, B., et al, eds.), Editura Academiei Republicii Socialiste Romania, pp.107\u2013127."},{"issue":"no.1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207728108963728","volume":"12","author":"M. Iri","year":"1981","unstructured":"Iri, M. and Fujishige, S.: Use of matroid theory in operations research, circuits and systems theory, Int. J. Systems Sci.,vol. 12, no. 1, 1981, pp. 27\u201354.","journal-title":"Int. J. Systems Sci."},{"issue":"3","key":"20_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TCT.1969.1082966","volume":"CT-16","author":"G. Kishi","year":"1969","unstructured":"Kishi, G. and Kajitani, Y.: Maximally distant trees and principal partition of a linear graph, IEEE Trans. Circuit Theory, CT-16,3,1969,pp.323\u2013330.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"20_CR7","volume-title":"Combinatorial Optimisation: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: Combinatorial Optimisation: Networks and Matroids, Holt, Rhinehart and Winston, New York, 1976."},{"key":"20_CR8","unstructured":"Murota, K. and Iri, M.: Matroidal approach to the structural solvability of a system of equations. Eleventh International Symposium on Mathematical Programming, Universitat Bonn, 1982."},{"key":"20_CR9","volume-title":"Ph.D. thesis","author":"H. Narayanan","year":"1974","unstructured":"Narayanan, H.: Theory of Matroids and Network Analysis, Ph.D. thesis, Department of Electrical Engineering, I.I.T. Bombay, 1974."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0024-3795(91)90070-D","volume":"144","author":"H. Narayanan","year":"1991","unstructured":"Narayanan, H.: The Principal Lattice of Partitions of a Submodular Function, Linear Algebra and its Applications, 144, 1991,pp. 179\u2013216.","journal-title":"Linear Algebra and its Applications"},{"key":"20_CR11","first-page":"227","volume":"E64","author":"H. Narayanan","year":"1981","unstructured":"Narayanan, H. and Vartak, M. N.: An elementary approach to the principal partition of a matroid, Transactions of the Institute of Electronics and Communication Engineers of Japan, vol. E64, 1981, pp.227\u2013234.","journal-title":"Transactions of the Institute of Electronics and Communication Engineers of Japan"},{"issue":"4","key":"20_CR12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TCT.1970.1083186","volume":"CT-17","author":"T. Ohtuski","year":"1970","unstructured":"Ohtuski, T., Ishizaki, Y. and Watanabe, H.: Topological degrees of freedom and mixed analysis of electrical networks, IEEE Trans. Circuit Theory, CT-17,4,1970,pp.491\u2013499.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/cta.4490040203","volume":"4","author":"T. Ozawa","year":"1976","unstructured":"Ozawa, T.: Topological conditions for the solvability of linear active networks, Circuit Theory and Applications, vol. 4, 1976, pp.125\u2013136.","journal-title":"Circuit Theory and Applications"},{"key":"20_CR14","volume-title":"Technical Report TR.049.91","author":"S. Patkar","year":"1991","unstructured":"Patkar, S. and Narayanan, H.: Fast algorithms for the Principal Partition of graphs and related problems, Technical Report TR.049.91, I.I.T. Bombay, 1991."},{"issue":"no.4","key":"20_CR15","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/moor.10.4.701","volume":"10","author":"J. Roskind","year":"1985","unstructured":"Roskind, J. and Tarjan, R. E.: A note on finding minimum-cost edge disjoint spanning trees, Math. Op. Res.,vol. 10, no. 4,1985, pp.701\u2013708.","journal-title":"Math. Op. Res."},{"key":"20_CR16","unstructured":"Saran, H. and Vazirani, V.V.: Finding the min k-cut within twice the optimal, Preprint, to appear in forthcoming FOCS."},{"key":"20_CR17","first-page":"83","volume":"J59A","author":"N. Tomizawa","year":"1976","unstructured":"Tomizawa, N.: Strongly Irreducible matroids and principal partition of a matroid into stronly irreducible minors (in Japanese), Transactions of the Institute of Electronics and Communication Engineers of Japan, vol. J59A, 1976, pp. 83\u201391.","journal-title":"Transactions of the Institute of Electronics and Communication Engineers of Japan"},{"key":"20_CR18","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"Welsh, D. J. A.: Matroid Theory, Academic Press, New York, 1976."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54967-6_76.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:27:15Z","timestamp":1619558835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54967-6_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549673","9783540466123"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-54967-6_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}