{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:02:37Z","timestamp":1648746157357},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":3972,"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":[[2002,9]]},"DOI":"10.1016\/s0304-3975(01)00261-4","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"563-570","source":"Crossref","is-referenced-by-count":1,"title":["On the submodular matrix representation of a digraph"],"prefix":"10.1016","volume":"287","author":[{"given":"Arlette","family":"Gaillard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Groeflin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan J.","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00261-4_BIB1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230150408","article-title":"On node constraint networks","volume":"15","author":"Gr\u00f6flin","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(01)00261-4_BIB2","first-page":"189","article-title":"Lattice polyhedra II","volume":"15","author":"Gr\u00f6flin","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00261-4_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0121202","article-title":"On lattice polyhedra III","volume":"8","author":"Hoffman","year":"1978","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0304-3975(01)00261-4_BIB4","series-title":"Combinatorics","first-page":"593","article-title":"On lattice polyhedra","author":"Hoffman","year":"1978"},{"key":"10.1016\/S0304-3975(01)00261-4_BIB5","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T07:38:49Z","timestamp":1554795529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397501002614"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00261-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}