{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:08Z","timestamp":1752461528575},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":[[1997,7]]},"DOI":"10.1016\/s0020-0190(97)00088-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"13-18","source":"Crossref","is-referenced-by-count":3,"title":["A linear time algorithm for finding depth-first spanning trees on trapezoid graphs"],"prefix":"10.1016","volume":"63","author":[{"given":"Hon-Chan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00088-4_BIB1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0219025","article-title":"Parallel depth-first search in general directed graphs","volume":"19","author":"Aggarwal","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/comjnl\/33.3.247","article-title":"Finding and updating depth-first spanning trees of acyclic digraphs in parallel","volume":"33","author":"Chaudhuri","year":"1990","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB3","first-page":"267","article-title":"Extensions of permutation and interval graphs","volume":"58","author":"Corneil","year":"1987"},{"key":"10.1016\/S0020-0190(97)00088-4_BIB4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","article-title":"Trapezoid graphs and their coloring","volume":"21","author":"Dagan","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(97)00088-4_BIB6","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/0219047","article-title":"Planar depth-first search in O(log n) parallel time","volume":"19","author":"Hagerup","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB7","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/jgt.3190190408","article-title":"On the existence of special depth first search trees","volume":"19","author":"Korach","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(97)00088-4_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(94)00159-6","article-title":"Dominations in trapezoid graphs","volume":"52","author":"Liang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(95)00118-V","article-title":"Steiner set and connected domination in trapezoid graphs","volume":"56","author":"Liang","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB10","doi-asserted-by":"crossref","unstructured":"Y. Liang, C. Rhee, S.K. Dhall and S. Lakshmivarahan, NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs, in: IEEE Proc. SOUTH-EASTCON '91, Vol. 1, pp. 582\u2013585.","DOI":"10.1109\/SECON.1991.147822"},{"key":"10.1016\/S0020-0190(97)00088-4_BIB11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jagm.1994.1034","article-title":"On the 2-chain subgraph cover and related problems","volume":"17","author":"Ma","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00088-4_BIB12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90053-1","article-title":"Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs","volume":"49","author":"Rhee","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/00207169508804419","article-title":"A new algorithm for minimum spanning tree using depth-first-search in an undirected graph","volume":"57","author":"Salehi-Fathabadi","year":"1995","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90048-8","article-title":"A linear-processor algorithm for depth-first search in planar graphs","volume":"29","author":"Shannon","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","article-title":"An efficient distributed depth-first-search algorithm","volume":"32","author":"Sharma","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00088-4_BIB16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000884?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000884?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:24Z","timestamp":1555959204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0020019097000884"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00088-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}