{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:11:03Z","timestamp":1648599063219},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0020-0190(94)90091-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"139-143","source":"Crossref","is-referenced-by-count":0,"title":["Recognition algorithm for intersection graphs of edge disjoint paths in a tree"],"prefix":"10.1016","volume":"49","author":[{"given":"B.S.","family":"Panda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.P.","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90091-4_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithm","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)90091-4_BIB2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel Merge Sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90091-4_BIB4","series-title":"Ph.D. Thesis","article-title":"Intersection graph algorithms","author":"Deitz","year":"1984"},{"key":"10.1016\/0020-0190(94)90091-4_BIB5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(94)90091-4_BIB6","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 Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(94)90091-4_BIB10","first-page":"151","article-title":"The edge intersection graphs of paths in a tree","volume":"55","author":"Golumbic","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(94)90091-4_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4153\/CMB-1963-001-x","article-title":"A characterization of block graphs","volume":"6","author":"Harary","year":"1963","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0020-0190(94)90091-4_BIB12","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(94)90091-4_BIB13","doi-asserted-by":"crossref","first-page":"810","DOI":"10.2307\/2317880","article-title":"What are the intersection graphs of arcs in a circle?","volume":"76","author":"Klee","year":"1969","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0190(94)90091-4_BIB14","first-page":"150","article-title":"Efficient parallel algorithms for chordal graphs","author":"Klein","year":"1988","journal-title":"Proc. IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(94)90091-4_BIB15","unstructured":"W.A. Lobb, Perfect graphs from paths in trees, Unpublished manuscript."},{"key":"10.1016\/0020-0190(94)90091-4_BIB16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a trees","volume":"41","author":"Monma","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(94)90091-4_BIB17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","article-title":"Intersection representations of graphs by Arcs","volume":"34","author":"Renz","year":"1970","journal-title":"Pacific J. Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB18","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90091-4_BIB19","first-page":"169","article-title":"A recognition algorithm for the intersection graphs of internally disjoint paths in trees","author":"Samy","year":"1991","journal-title":"Proc. National Seminar on Theoretical Computer Science"},{"key":"10.1016\/0020-0190(94)90091-4_BIB20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(93)90116-6","article-title":"A faster algorithm to recognize undirected path graphs","volume":"43","author":"Sch\u00e4ffer","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB21","first-page":"141","article-title":"Fast parallel algorithms for recognizing strongly chordal, ptolemic, and block graphs","volume":"Vol. III","author":"Sridhar","year":"1990","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(94)90091-4_BIB22","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(85)90050-0","article-title":"Triangulated edge intersection graphs of paths in a tree","volume":"55","author":"Syslo","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","article-title":"Decomposition by clique separators","volume":"55","author":"Tarjan","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(94)90091-4_BIB24","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90091-4_BIB25","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90091-4_BIB26","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","article-title":"Representations of chordal graphs as subtrees of a tree","volume":"2","author":"Walter","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900914?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900914?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:21Z","timestamp":1555144161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900914"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90091-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}