{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:03:27Z","timestamp":1648890207720},"reference-count":24,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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":1543,"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":[[2009,6]]},"DOI":"10.1016\/j.dam.2009.03.006","type":"journal-article","created":{"date-parts":[[2009,4,16]],"date-time":"2009-04-16T08:16:18Z","timestamp":1239869778000},"page":"2525-2535","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of recognizing directed path families"],"prefix":"10.1016","volume":"157","author":[{"given":"N.","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"P.G.","family":"Franciosa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"21","key":"10.1016\/j.dam.2009.03.006_b1","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1016\/j.disc.2007.01.009","article-title":"A characterization of partial directed line graphs","volume":"307","author":"Apollonio","year":"2007","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b2","series-title":"Beitr\u00e4ge zur Graphentheorie","first-page":"17","article-title":"On derived graphs and digraphs","author":"Beineke","year":"1968"},{"key":"10.1016\/j.dam.2009.03.006_b3","first-page":"123","article-title":"Adjoints of pure bidirected graphs","volume":"39","author":"Benzaken","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/j.dam.2009.03.006_b4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/j.dam.2009.03.006_b5","series-title":"Hypergraphes, Combinatoires des ensemble finis","author":"Berge","year":"1987"},{"key":"10.1016\/j.dam.2009.03.006_b6","series-title":"Handbook of Combinatorics","first-page":"551","article-title":"Matroid Optimization and Algorithms","author":"Bixby","year":"1995"},{"key":"10.1016\/j.dam.2009.03.006_b7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.dam.2009.03.006_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00109-2","article-title":"On some properties of DNA graphs","volume":"98","author":"Blazewicz","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b9","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.dam.2009.03.006_b10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0166-218X(90)90141-X","article-title":"A note on line digraphs and the directed max-cut problem","volume":"29","author":"Chv\u00e1tal","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b11","series-title":"Handbook of Combinatorics","first-page":"381","article-title":"Hypergraphs","author":"Duchet","year":"1995"},{"key":"10.1016\/j.dam.2009.03.006_b12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(83)90018-3","article-title":"Hypergraphes de Chaines d\u2019 Aretes d\u2019un Arbre","volume":"43","author":"Fournier","year":"1983","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ-graph algorithm for solving the graph realization problem","volume":"21","author":"Fujishige","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.dam.2009.03.006_b14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90070-5","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b17","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","article-title":"The edge intersection graphs of paths in a tree","volume":"38","author":"Golumbic","year":"1985","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"10.1016\/j.dam.2009.03.006_b18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","article-title":"Edge and vertex intersection of paths in a tree","volume":"55","author":"Golumbic","year":"1985","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b19","series-title":"Proc. 4th Southeastern Conf. on Combinatorics, Graph, Theory and Computing","first-page":"3","article-title":"Coverings and colorings of hypergraphs","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/j.dam.2009.03.006_b20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"10.1016\/j.dam.2009.03.006_b21","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.dam.2009.03.006_b22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","article-title":"The matroids with the max-flow min-cut property","volume":"23","author":"Seymour","year":"1977","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/j.dam.2009.03.006_b23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(93)E0170-4","article-title":"The arborescence-realization problem","volume":"59","author":"Swaminathan","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2009.03.006_b24","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/0166-218X(92)90156-5","article-title":"The underlying graph of a line digraph","volume":"37\u201338","author":"Villar","year":"1992","journal-title":"Discrete Applied Mathematics"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09001036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09001036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:57:08Z","timestamp":1545310628000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X09001036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0166218X09001036"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2009.03.006","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}