{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:46:07Z","timestamp":1649076367472},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"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,8]]},"DOI":"10.1016\/0012-365x(93)90114-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"13-20","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for optimum common root functions of two digraphs"],"prefix":"10.1016","volume":"119","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90114-9_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1002\/jgt.3190130211","article-title":"Common root functions of two digraphs","volume":"13","author":"Cai","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90114-9_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0012-365X(90)90321-8","article-title":"Restricted covering of digraphs with arborescences","volume":"82","author":"Cai","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90114-9_BIB3","first-page":"273","article-title":"Covering two digraphs with arborescences","volume":"3","author":"Cai","year":"1990","journal-title":"J. Systems Sci. Math. Sci."},{"key":"10.1016\/0012-365X(93)90114-9_BIB4","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/0012-365X(93)90114-9_BIB5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(93)90114-9_BIB6","first-page":"189","article-title":"An algorithm for submodular functions on graphs","volume":"16","author":"Frank","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90114-9_BIB7","first-page":"129","article-title":"An algorithm for the unbounded matroid intersection polyhedron","volume":"19","author":"Frank","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90114-9_BIB8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","article-title":"On two minimax theorems in graph theory","volume":"2","author":"Lov\u00e1sz","year":"1976","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93901149?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93901149?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:23Z","timestamp":1555120523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93901149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0012365X93901149"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90114-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}