{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T06:38:57Z","timestamp":1784097537446,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90158-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"231-243","source":"Crossref","is-referenced-by-count":20,"title":["Submodular functions in graph theory"],"prefix":"10.1016","volume":"111","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90158-P_BIB1","series-title":"Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/0012-365X(93)90158-P_BIB2","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/0012-365X(93)90158-P_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0012-365X(93)90158-P_BIB4","series-title":"Algebraic Methods in Graph Theory","first-page":"159","article-title":"On disjoint trees and arborescences","author":"Frank","year":"1981"},{"key":"10.1016\/0012-365X(93)90158-P_BIB5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF01589418","article-title":"Generalized polymatroids and submodular flows","volume":"42","author":"Frank","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(93)90158-P_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","article-title":"Augmenting graphs to meet edge-connectivity requirements","volume":"5","author":"Frank","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(93)90158-P_BIB7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(93)90158-P_BIB8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","article-title":"On two min-max theorems in graph theory","volume":"21","author":"Lov\u00e1sz","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90158-P_BIB9","series-title":"Mathematical Programming-The State of the Art","first-page":"235","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/0012-365X(93)90158-P_BIB10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01238648","article-title":"Ecken vom Innen- und Aussengrad n in minimal n-fach kantenzusammenh\u00e4ngenden Digraphen","author":"Mader","year":"1974","journal-title":"Arch. Math."},{"key":"10.1016\/0012-365X(93)90158-P_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","article-title":"Konstruktion aller n-fach kantenzusammenhangenden Digraphen","volume":"3","author":"Mader","year":"1982","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(93)90158-P_BIB12","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/0012-365X(93)90158-P_BIB13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390158P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390158P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:52Z","timestamp":1555134712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390158P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390158P"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90158-p","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}