{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:56:54Z","timestamp":1648666614975},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":5403,"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":[[1998,10]]},"DOI":"10.1016\/s0166-218x(98)00056-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"187-201","source":"Crossref","is-referenced-by-count":1,"title":["An optimal parallel algorithm for node ranking of cographs"],"prefix":"10.1016","volume":"87","author":[{"given":"Liu","family":"Chuan-Ming","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Ming-Shing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00056-0_BIB1","first-page":"292","article-title":"Rankings of graphs","volume":"vol. 903","author":"Bodlaender","year":"1996"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB2","series-title":"Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'91","first-page":"1","article-title":"Approximating treewidth, pathwidth, and minimum elimination tree height","volume":"vol. 570","author":"Bodlaender","year":"1992"},{"issue":"2","key":"10.1016\/S0166-218X(98)00056-0_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","article-title":"The pathwidth and treewidth of cographs","volume":"6","author":"Bodlaender","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB6","first-page":"747","article-title":"On vertex ranking for permutation and other graphs","volume":"vol. 775","author":"Deogun","year":"1994"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear equations","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","article-title":"Optimal node ranking of trees","volume":"28","author":"Iyer","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB9","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB10","article-title":"The Art of Computer Programming","volume":"vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB11","series-title":"Proceedings of the 3rd Aegean Workshop on Computing, AWOC88","first-page":"101","article-title":"Optimal parallel evaluation of tree-structured computations by raking","author":"Kosaraju","year":"1988"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB12","series-title":"Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB13","series-title":"Proceedings of the 2nd Annual IEEE Symposium on Parallel and Distributed Computing","first-page":"26","article-title":"Parallel algorithms for ranking of trees","author":"Liang","year":"1990"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB15","series-title":"Concurrent Design of Products and Processes","year":"1989"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB16","article-title":"The complexity of optimal elimination trees","author":"Pothen","year":"1988"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","article-title":"Optimal node ranking of trees in linear time","volume":"33","author":"Sch\u00e4ffer","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB18","series-title":"3rd Twente Workshop on Graph and Combinatorial Optimization","article-title":"Node ranking and searching on cographs (Abstract)","author":"Scheffler","year":"1993"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","article-title":"On a graph partition problem with application to VLSI layout","volume":"43","author":"Sen","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB20","series-title":"Proceedings of the 3rd Annual IEEE Symposium on Parallel and Distributed Computing","first-page":"767","article-title":"Super critical tree numbering and optimal tree ranking are in NC","author":"de la Torre","year":"1991"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1142\/S0129626492000155","article-title":"Optimal tree ranking is in NC","volume":"2","author":"de la Torre","year":"1992","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(98)00056-0_BIB22","series-title":"Proceedings of the 4th ACM Symposium on Discrete Algorithms","first-page":"138","article-title":"Optimal ranking of trees in polynomial time","author":"de la Torre","year":"1993"},{"key":"10.1016\/S0166-218X(98)00056-0_BIB23","series-title":"Proceedings of the International Conference on Parallel Processing","first-page":"III160","article-title":"Optimal parallel algorithms for some problems on trees","author":"Yu","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000560?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000560?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:22Z","timestamp":1556666842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0166218X98000560"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00056-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}