{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:01:08Z","timestamp":1772827268711,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"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":9663,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1016\/0166-218x(87)90067-9","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"91-99","source":"Crossref","is-referenced-by-count":58,"title":["Exact arborescences, matchings and cycles"],"prefix":"10.1016","volume":"16","author":[{"given":"Francisco","family":"Barahona","sequence":"first","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\/0166-218X(87)90067-9_BIB1","series-title":"Balancing signed toroidal graphs in polynomial time","author":"Barahona","year":"1981"},{"key":"10.1016\/0166-218X(87)90067-9_BIB2","series-title":"Developments in Operations Research","first-page":"29","article-title":"An algorithm to construct a minimum directed spanning tree in a directed network","author":"Bock","year":"1971"},{"key":"10.1016\/0166-218X(87)90067-9_BIB3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0097-3165(78)90067-5","article-title":"Matrix tree theorems","volume":"24","author":"Chaiken","year":"1978","journal-title":"J. Combin. Theory (A)"},{"key":"10.1016\/0166-218X(87)90067-9_BIB4","first-page":"1396","article-title":"On the shortest aborescence of a directed graph","volume":"4","author":"Yoeng-Yin","year":"1965","journal-title":"Scientia Sinica"},{"key":"10.1016\/0166-218X(87)90067-9_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","article-title":"Optimum branchings","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards (Sect. B)"},{"key":"10.1016\/0166-218X(87)90067-9_BIB6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representatives and linear algebra","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards (Sect. B)"},{"key":"10.1016\/0166-218X(87)90067-9_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580218","article-title":"Packing rooted directed cuts in a weighted directed graph","volume":"6","author":"Fulkerson","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90067-9_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/net.3230080304","article-title":"A good algorithm for smallest spanning trees with a degree constraint","volume":"8","author":"Gabow","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90067-9_BIB9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(87)90067-9_BIB10","article-title":"The generalized quasi-greedy algorithm for constrained minimum weight matroid bases Part I","author":"Glover","year":"1984"},{"key":"10.1016\/0166-218X(87)90067-9_BIB11","series-title":"Combinatorial Programming: Methods and Applications","first-page":"111","article-title":"Finding minimum spanning trees with a fixed number of links at a node","author":"Glover","year":"1974"},{"key":"10.1016\/0166-218X(87)90067-9_BIB12","series-title":"Graph Theory and Theoretical Physics","first-page":"43","article-title":"Graph theory and crystal physics","author":"Kasteleyn","year":"1967"},{"key":"10.1016\/0166-218X(87)90067-9_BIB13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900679?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900679?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:56:52Z","timestamp":1553947012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0166218X87900679"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90067-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}