{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T21:59:50Z","timestamp":1718920790534},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00462-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:09:00Z","timestamp":1062601740000},"page":"385-400","source":"Crossref","is-referenced-by-count":43,"title":["On the orientation of graphs and hypergraphs"],"prefix":"10.1016","volume":"131","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[]},{"given":"Zolt\u00e1n","family":"Kir\u00e1ly","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00462-6_BIB1","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/S0166-218X(02)00462-6_BIB2","unstructured":"A. Frank, On disjoint trees and arborescences, in: Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis Janos Bolyai, Vol. 25, North-Holland, Amsterdam, 1978, pp. 159\u2013169."},{"issue":"1\u20132","key":"10.1016\/S0166-218X(02)00462-6_BIB3","first-page":"63","article-title":"Kernel systems of directed graphs","volume":"41","author":"Frank","year":"1979","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"3","key":"10.1016\/S0166-218X(02)00462-6_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","article-title":"On the orientation of graphs","volume":"28","author":"Frank","year":"1980","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(02)00462-6_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592217","article-title":"Structures of polyhedra determined by submodular functions on crossing families","volume":"29","author":"Fujishige","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00462-6_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","article-title":"Directed hypergraphs and applications","volume":"40","author":"Gallo","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00462-6_BIB7","first-page":"97","article-title":"Directed hypergraphs as a modelling paradigm","volume":"21","author":"Gallo","year":"1998","journal-title":"Riv. AMASES"},{"key":"10.1016\/S0166-218X(02)00462-6_BIB8","unstructured":"S. Khanna, J. Naor, F.B. Shepherd, Directed network design with orientation constraints, in: Proceedings of the Eleventh Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 2000, pp. 663\u2013671."},{"key":"10.1016\/S0166-218X(02)00462-6_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00462-6_BIB10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd vertex pairings in finite graphs","volume":"12","author":"J.A. Nash-Williams","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(02)00462-6_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0166-218X(02)00462-6_BIB12","series-title":"Progress in Combinatorial Optimization","first-page":"315","article-title":"Total dual integrality from directed graphs, crossing families and sub- and supermodular functions","author":"Schrijver","year":"1984"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004626?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004626?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:55:09Z","timestamp":1551095709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004626"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00462-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}