{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:50Z","timestamp":1775054630957,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00160-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"215-225","source":"Crossref","is-referenced-by-count":7,"title":["How to tidy up a symmetric set-system by use of uncrossing operations"],"prefix":"10.1016","volume":"157","author":[{"given":"Alexander V.","family":"Karzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00160-3_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min-max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(95)00160-3_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0304-3975(95)00160-3_BIB3","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/0304-3975(95)00160-3_BIB4","first-page":"273","article-title":"Graphic programming using odd and even points","volume":"1","author":"Guan","year":"1962","journal-title":"Chinese Mathematics"},{"key":"10.1016\/0304-3975(95)00160-3_BIB5","series-title":"Colloquia Mathematica Societies Janos Bolyai, 52. Combinatorics","first-page":"309","article-title":"How to tidy up your set-system?","author":"Hurkens","year":"1987"},{"key":"10.1016\/0304-3975(95)00160-3_BIB6","series-title":"Combinatorial Methods for Flow Problems","first-page":"6","article-title":"Combinatorial methods to solve cut-determined multiflow problems","author":"Karzanov","year":"1979"},{"key":"10.1016\/0304-3975(95)00160-3_BIB7","series-title":"Finite and Infinite Sets","first-page":"443","article-title":"A generalized MFMC-prorerty and multicommodity cut problems","volume":"Vol. 2","author":"Karzanov","year":"1984"},{"key":"10.1016\/0304-3975(95)00160-3_BIB8","first-page":"11p","author":"Karzanov","year":"1990"},{"key":"10.1016\/0304-3975(95)00160-3_BIB9","first-page":"178","article-title":"On odd cuts and plane multicommodity flows","volume":"42","author":"Seymour","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001603?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001603?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:57:50Z","timestamp":1556301470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001603"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00160-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}