{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:20:50Z","timestamp":1648624850700},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00262-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"131-135","source":"Crossref","is-referenced-by-count":12,"title":["On vertex ranking of a starlike graph"],"prefix":"10.1016","volume":"82","author":[{"given":"Sun-yuan","family":"Hsieh","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00262-9_BIB001","series-title":"Proceedings of 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91","first-page":"1","article-title":"Approximating tree-width, pathwidth and minimum elimination tree height","volume":"570","author":"Bodlaender","year":"1992"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB002","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB003","series-title":"Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"747","article-title":"On vertex ranking for permutation and other graphs","volume":"775","author":"Deogun","year":"1994"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB004","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\/S0020-0190(01)00262-9_BIB005","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\/S0020-0190(01)00262-9_BIB006","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579333","article-title":"The splittance of a graph","volume":"1","author":"Hammer","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB007","series-title":"Parallel assembly of modular products-an analysis, Technical Report 88-06","author":"Iyer","year":"1988"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB008","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","article-title":"On edge ranking problems of trees and graphs","volume":"30","author":"Iyer","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00262-9_BIB009","series-title":"Ordered colorings, Manuscript","author":"Katchalski","year":"1988"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB010","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\/S0020-0190(01)00262-9_BIB011","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\/S0020-0190(01)00262-9_BIB012","series-title":"The complexity of optimal elimination trees, Technical Report CS-88-13","author":"Pothen","year":"1988"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB013","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\/S0020-0190(01)00262-9_BIB014","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":"Schaffer","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00262-9_BIB015","series-title":"Proceedings of 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum No. 1132","article-title":"Node ranking and searching on graphs (abstract)","author":"Scheffler","year":"1993"},{"key":"10.1016\/S0020-0190(01)00262-9_BIB016","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\/S0020-0190(01)00262-9_BIB017","series-title":"Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX","first-page":"138","article-title":"Optimal edge ranking of trees in polynomial time","author":"de la Torre","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002629?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002629?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:28:19Z","timestamp":1556760499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002629"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00262-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}