{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:43:40Z","timestamp":1757616220370,"version":"3.44.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":5782,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0022-0000(90)90020-l","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"88-123","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["On maximum flows in polyhedral domains"],"prefix":"10.1016","volume":"40","author":[{"given":"Joseph S.B.","family":"Mitchell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90020-L_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(90)90020-L_BIB2","series-title":"Proceedings, Third Annual ACM Conference on Computational Geometry","first-page":"251","article-title":"Rectilinear shortest paths through polygonal obstacles in O(n log2 n) time","author":"Clarkson","year":"1987"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90020-L_BIB3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90020-L_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/0022-0000(90)90020-L_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(90)90020-L_BIB6","series-title":"Proceedings, 19th Symp. on Foundations of Computer Science","first-page":"231","article-title":"A new algorithm for the maximal flow problem","author":"Galil","year":"1978"},{"key":"10.1016\/0022-0000(90)90020-L_BIB7","series-title":"Proceedings, Fourth Annual ACM Symposium on Computational Geometry","first-page":"266","article-title":"Path planning in 0\/1\/\u221e weighted regions with applications","author":"Gewali","year":"1988"},{"key":"10.1016\/0022-0000(90)90020-L_BIB8","series-title":"Proceedings, Third Annual ACM Conference on Computational Geometry","first-page":"50","article-title":"Optimal shortest path queries in a simple polygon","author":"Guibas","year":"1987"},{"key":"10.1016\/0022-0000(90)90020-L_BIB9","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"issue":"No. 4","key":"10.1016\/0022-0000(90)90020-L_BIB10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90020-L_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(81)90120-4","article-title":"Maximum flow in (s, t)-planar networks","volume":"13","author":"Hassin","year":"1981","journal-title":"Inform. Process. Lett."},{"year":"1969","series-title":"Integer Programming and Network Flows","author":"Hu","key":"10.1016\/0022-0000(90)90020-L_BIB12"},{"article-title":"Survey of Mathematical Programming","year":"1979","author":"IRI","key":"10.1016\/0022-0000(90)90020-L_BIB13"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90020-L_BIB14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0208012","article-title":"Maxium flow in planar networks","volume":"8","author":"Itai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90020-L_BIB15","series-title":"Proceedings, 14th IEEE Symposium on Foundations of Computer Science","first-page":"18","article-title":"Efficient computation of continuous skeletons","author":"Kirkpatrick","year":"1979"},{"key":"10.1016\/0022-0000(90)90020-L_BIB16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","article-title":"Medial axis transformation of a planar shape","volume":"4","author":"Lee","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"article-title":"Planning Shortest Paths","year":"1986","author":"Mitchell","key":"10.1016\/0022-0000(90)90020-L_BIB17"},{"article-title":"Shortest Paths Among Obstacles, Zero-Cost Regions, and Roads","year":"1987","author":"Mitchell","key":"10.1016\/0022-0000(90)90020-L_BIB18"},{"article-title":"Shortest Rectilinear Paths Among Obstacles","year":"1987","author":"Mitchell","key":"10.1016\/0022-0000(90)90020-L_BIB19"},{"key":"10.1016\/0022-0000(90)90020-L_BIB20","series-title":"Proceedings, Fourth Annual ACM Symposium on Computational Geometry","first-page":"341","article-title":"On maximum flows in polyhedral domains","author":"Mitchell","year":"1988"},{"issue":"No. 4","key":"10.1016\/0022-0000(90)90020-L_BIB21","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","article-title":"The discrete geodesic problem","volume":"16","author":"Mitchell","year":"1987","journal-title":"SIAM J. Comput."},{"article-title":"The Weighted Region Problem","year":"1985","author":"Mitchell","key":"10.1016\/0022-0000(90)90020-L_BIB22_1"},{"year":"1987","series-title":"Proceedings, Third Annual ACM Conference on Computational Geometry","key":"10.1016\/0022-0000(90)90020-L_BIB22_2"},{"key":"10.1016\/0022-0000(90)90020-L_BIB23","series-title":"Proceedings, Foundations of Software Technology and Theoretical Computer Science","article-title":"Shortest-path motion","author":"Papadimitriou","year":"1986"},{"article-title":"Shortest Paths in Euclidean Space with Polyhedral Obstacles","year":"1985","author":"Reif","key":"10.1016\/0022-0000(90)90020-L_BIB24"},{"year":"1988","series-title":"Constrained Delaunay triangulations and Voronoi diagrams with obstacles","author":"Seidel","key":"10.1016\/0022-0000(90)90020-L_BIB25"},{"key":"10.1016\/0022-0000(90)90020-L_BIB26","series-title":"Proceedings, 16th Symp. on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0022-0000(90)90020-L_BIB27","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90020-L_BIB28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02592050","article-title":"Maximal flow through a domain","volume":"26","author":"Strang","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0022-0000(90)90020-L_BIB29","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph for n line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(90)90020-L_BIB30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geom."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090020L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090020L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:11:02Z","timestamp":1757095862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090020L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["002200009090020L"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90020-l","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1990,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On maximum flows in polyhedral domains","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(90)90020-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}