{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T19:41:05Z","timestamp":1697917265356},"reference-count":7,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7619,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give node constraint versions of the circulation theorem and max flow\u2010min cut and min flow\u2010max cut theorems, and show how they provide a short and elementary treatment of the problems of finding in a poset an optimum antichain or an optimum convex set.<\/jats:p>","DOI":"10.1002\/net.3230150408","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:17:42Z","timestamp":1178914662000},"page":"469-475","source":"Crossref","is-referenced-by-count":2,"title":["On node constraint networks"],"prefix":"10.1002","volume":"15","author":[{"given":"Heinz","family":"Gr\u00f6flin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"229","volume-title":"Proc. 10th S.\u2010E. Conf. Combinatorics, Graph Theory and Computing","author":"Cameron K. B.","year":"1979"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2307\/1969503"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"issue":"4","key":"e_1_2_1_5_2","first-page":"281","volume":"4","author":"Groflin H.","year":"1984","journal-title":"Path\u2010closed sets. Combinntorica"},{"key":"e_1_2_1_6_2","first-page":"239","article-title":"Lattice polyhedra II, generalization, constructions and examples","volume":"15","author":"Gr\u00f6flin H.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"e_1_2_1_8_2","volume-title":"Network Flows and Monotropic Optimization","author":"Rockafellar R. T.","year":"1984"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T20:06:48Z","timestamp":1697832408000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["10.1002\/net.3230150408"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150408","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}