{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:53:55Z","timestamp":1743108835649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_35","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"402-413","source":"Crossref","is-referenced-by-count":2,"title":["Disclosing Barriers: A Generalization of the Canonical Partition Based on Lov\u00e1sz\u2019s Formulation"],"prefix":"10.1007","author":[{"given":"Nanao","family":"Kita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1103963.1103969","volume":"1","author":"M.H. Carvalho","year":"2005","unstructured":"Carvalho, M.H., Cheriyan, J.: An O(VE) algorithm for ear decompositions of matching-covered graphs. ACM Transactions on Algorithms\u00a01(2), 324\u2013337 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publishing (2009)","DOI":"10.1090\/chel\/367"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Carvalho, M.H., Lucchesi, C.L., Murty, U.S.R.: The matching lattice. In: Reed, B., Sales, C.L. (eds.) Recent Advances in Algorithms and Combinatorics. Springer (2003)","DOI":"10.1007\/0-387-22444-0_1"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Kita, N.: A partially ordered structure and a generalization of the canonical partition for general graphs with perfect matchings. CoRR abs\/1205.3816 (2012)","DOI":"10.1007\/978-3-642-35261-4_12"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Kita, N.: A partially ordered structure and a generalization of the canonical partition for general graphs with perfect matchings. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 85\u201394. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-35261-4_12"},{"key":"35_CR6","unstructured":"Kita, N.: A generalization of the Dulmage-Mendelsohn decomposition for general graphs (preprint)"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01202790","volume":"13","author":"A. Frank","year":"1993","unstructured":"Frank, A.: Conservative weightings and ear-decompositions of graphs. Combinatorica\u00a013(1), 65\u201381 (1993)","journal-title":"Combinatorica"},{"key":"35_CR8","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer (2003)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"A.L. Dulmage","year":"1958","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Canadian Journal of Mathematics\u00a010, 517\u2013534 (1958)","journal-title":"Canadian Journal of Mathematics"},{"key":"35_CR10","first-page":"1","volume":"53","author":"A.L. Dulmage","year":"1959","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: A structure theory of bipartite graphs of finite exterior dimension. Transactions of the Royal Society of Canada, Section III\u00a053, 1\u201313 (1959)","journal-title":"Transactions of the Royal Society of Canada, Section III"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/0111014","volume":"11","author":"A.L. Dulmage","year":"1963","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Two algorithms for bipartite graphs. Journal of the Society for Industrial and Applied Mathematics\u00a011(1), 183\u2013194 (1963)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"35_CR12","unstructured":"Murota, K.: Matrices and matroids for systems analysis. Springer (2000)"},{"key":"35_CR13","unstructured":"Kotzig, A.: Z te\u00f3rie kone\u010dn\u00fdch grafov s line\u00e1rnym faktorom. I. Mathematica Slovaca\u00a09(2), 73\u201391 (1959) (in slovak)"},{"key":"35_CR14","unstructured":"Kotzig, A.: Z te\u00f3rie kone\u010dn\u00fdch grafov s line\u00e1rnym faktorom. II. Mathematica Slovaca\u00a09(3), 136\u2013159 (1959) (in slovak)"},{"key":"35_CR15","unstructured":"Kotzig, A.: Z te\u00f3rie kone\u010dn\u00fdch grafov s line\u00e1rnym faktorom. III. Mathematica Slovaca\u00a010(4), 205\u2013215 (1960) (in slovak)"},{"key":"35_CR16","unstructured":"Kir\u00e1ly, Z.: The calculus of barriers. Technical Report TR-9801-2, ELTE (1998)"},{"key":"35_CR17","unstructured":"Kita, N.: A canonical characterization of the family of barriers in general graphs. CoRR abs\/1212.5960 (2012)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:39:49Z","timestamp":1558687189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}