{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:44Z","timestamp":1740109244871,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T00:00:00Z","timestamp":1451865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T00:00:00Z","timestamp":1451865600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["25287030"],"award-info":[{"award-number":["25287030"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26280004"],"award-info":[{"award-number":["26280004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00453-015-0109-4","type":"journal-article","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T16:26:39Z","timestamp":1451924799000},"page":"815-835","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors"],"prefix":"10.1007","volume":"77","author":[{"given":"Shun","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"109_CR1","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/TAC.1982.1102999","volume":"AC\u201327","author":"C Commault","year":"1982","unstructured":"Commault, C., Dion, J.M.: Structure at infinity of linear multivariable systems: a geometric approach. IEEE Trans. Autom. Control AC\u201327, 693\u2013696 (1982)","journal-title":"IEEE Trans. Autom. Control"},{"key":"109_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/0001-8708(92)90028-J","volume":"93","author":"AWM Dress","year":"1992","unstructured":"Dress, A.W.M., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214\u2013250 (1992)","journal-title":"Adv. Math."},{"issue":"2","key":"109_CR3","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"109_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09947-6","volume-title":"Solving Ordinary Differential Equations II","author":"E Hairer","year":"1991","unstructured":"Hairer, E., Wanner, G.: Solving Ordinary Differential Equations II. Springer, Berlin (1991)"},{"key":"109_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00453-003-1022-9","volume":"36","author":"S Iwata","year":"2003","unstructured":"Iwata, S.: Computing the maximum degree of minors in matrix pencils via combinatorial relaxation. Algorithmica 36, 331\u2013341 (2003)","journal-title":"Algorithmica"},{"key":"109_CR6","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/0917064","volume":"17","author":"S Iwata","year":"1996","unstructured":"Iwata, S., Murota, K., Sakuta, I.: Primal-dual combinatorial relaxation algorithms for the maximum degree of subdeterminants. SIAM J. Sci. Comput. 17, 993\u20131012 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"109_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s00453-012-9640-8","volume":"66","author":"S Iwata","year":"2013","unstructured":"Iwata, S., Takamatsu, M.: Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation. Algorithmica 66, 346\u2013368 (2013)","journal-title":"Algorithmica"},{"key":"109_CR8","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/0219077","volume":"19","author":"K Murota","year":"1990","unstructured":"Murota, K.: Computing Puiseux-series solutions to determinantal equations via combinatorial relaxation. SIAM J. Comput. 19, 1132\u20131161 (1990)","journal-title":"SIAM J. Comput."},{"key":"109_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01235719","volume":"6","author":"K Murota","year":"1995","unstructured":"Murota, K.: Combinatorial relaxation algorithm for the maximum degree of subdeterminants: computing Smith-McMillan form at infinity and structural indices in Kronecker form. Appl. Algebra Eng. Commun. Comput. 6, 251\u2013273 (1995)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"109_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1137\/S0097539791201897","volume":"24","author":"K Murota","year":"1995","unstructured":"Murota, K.: Computing the degree of determinants via combinatorial relaxation. SIAM J. Comput. 24, 765\u2013796 (1995)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"109_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0893-9659(95)00043-P","volume":"8","author":"K Murota","year":"1995","unstructured":"Murota, K.: Finding optimal minors of valuated bimatroids. Appl. Math. Lett. 8(4), 37\u201341 (1995)","journal-title":"Appl. Math. Lett."},{"key":"109_CR12","volume-title":"Matrices and Matroids for Systems Analysis","author":"K Murota","year":"2000","unstructured":"Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)"},{"key":"109_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.14495\/jsiaml.7.49","volume":"7","author":"S Sato","year":"2015","unstructured":"Sato, S.: Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices. JSIAM Lett. 7, 49\u201352 (2015)","journal-title":"JSIAM Lett."},{"key":"109_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230010206","volume":"1","author":"N Tomizawa","year":"1971","unstructured":"Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks 1, 173\u2013194 (1971)","journal-title":"Networks"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0109-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0109-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0109-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0109-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:31:33Z","timestamp":1589697093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0109-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,4]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0109-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2016,1,4]]},"assertion":[{"value":"26 August 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}