{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:43:31Z","timestamp":1746002611582},"reference-count":3,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1137\/0209020","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:21:58Z","timestamp":1109226118000},"page":"219-224","source":"Crossref","is-referenced-by-count":7,"title":["A Multiterminal Minimum Cut Algorithm for Planar Graphs"],"prefix":"10.1137","volume":"9","author":[{"given":"Yossi","family":"Shiloach","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0204043"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0208012"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0209020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:14:48Z","timestamp":1485692088000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0209020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["10.1137\/0209020"],"URL":"https:\/\/doi.org\/10.1137\/0209020","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}