{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:10Z","timestamp":1725663730147},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_187","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:21:13Z","timestamp":1330244473000},"page":"747-758","source":"Crossref","is-referenced-by-count":18,"title":["On vertex ranking for permutation and other graphs"],"prefix":"10.1007","author":[{"given":"J. S.","family":"Deogun","sequence":"first","affiliation":[]},{"given":"T.","family":"Kloks","sequence":"additional","affiliation":[]},{"given":"D.","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"H.","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"61_CR1","volume-title":"Technical Report No 80","author":"B. Aspvall","year":"1993","unstructured":"B. Aspvall and P. Heggernes, Finding minimum height elimination trees for interval graphs in polynomial time, Technical Report No 80, Department of Informatics, University of Bergen, Norway, 1993."},{"key":"61_CR2","unstructured":"H. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. M\u00fcller and Z. Tuza, Rankings of graphs, in preparation."},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson and T. Kloks, Approximating treewidth, pathwidth and minimum elimination tree height, Proc. 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91, Springer-Verlag, Lecture Notes in Computer Science 570, 1992, pp. 1\u201312.","DOI":"10.1007\/3-540-55121-2_1"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, Proceedings of the 20th International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science 700, 1993, pp. 114\u2013125.","DOI":"10.1007\/3-540-56939-1_66"},{"key":"61_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"A. Brandst\u00e4dt and D. Kratsch, On domination problems for permutation and other graphs, Theoretical Computer Science 54 (1987), 181\u2013198.","journal-title":"Theoretical Computer Science"},{"key":"61_CR6","unstructured":"A. Brandst\u00e4dt, Special graph classes \u2014 a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universit\u00e4t Duisburg Gesamthochschule, 1991."},{"key":"61_CR7","first-page":"19","volume":"79","author":"J.S. Deogun","year":"1990","unstructured":"J.S. Deogun and Y. Peng, Edge ranking of trees, Congressius Numerantium 79 (1990), 19\u201328.","journal-title":"Congressius Numerantium"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"P. Duchet, Classical perfect graphs, in: Topics on Perfect Graphs, C. Berge and V. Chv\u00e1tal, (eds.), Annals of Discrete Mathematics 21, 1984, pp. 67\u201396.","DOI":"10.1016\/S0304-0208(08)72924-4"},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"I.S. Duff and J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Transactions on Mathematical Software 9 (1983), 302\u2013325.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"61_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M. Farber","year":"1985","unstructured":"M. Farber and M. Keil, Domination in permutation graphs, Journal of Algorithms 6 (1985), 309\u2013321.","journal-title":"Journal of Algorithms"},{"key":"61_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Scientiarum Hungaricae 18 (1967), 25\u201366.","journal-title":"Acta Mathematica Scientiarum Hungaricae"},{"key":"61_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"61_CR13","unstructured":"A.V. Iyer, H.D. Ratliff and G. Vijayan, Parallel assembly of modular products-an analysis, Technical Report 88-06, Georgia Institute of Technology, 1988."},{"key":"61_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"A.V. Iyer","year":"1991","unstructured":"A.V. Iyer, H.D. Ratliff and G. Vijayan, On edge ranking problems of trees and graphs, Discrete Applied Mathematics 30 (1991), 43\u201352.","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR15","unstructured":"M. Katchalski, W. McCuaig and S. Seager, Ordered colourings, Manuscript, University of Waterloo, 1988."},{"key":"61_CR16","volume-title":"Ph.D. Thesis","author":"T. Kloks","year":"1993","unstructured":"T. Kloks, Treewidth, Ph.D. Thesis, Utrecht University, The Netherlands, 1993."},{"key":"61_CR17","doi-asserted-by":"crossref","unstructured":"C.E. Leiserson, Area efficient graph layouts for VLSI, Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"key":"61_CR18","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM Journal of Matrix Analysis and Applications 11 (1990), 134\u2013172.","journal-title":"SIAM Journal of Matrix Analysis and Applications"},{"key":"61_CR19","unstructured":"J. Nevins and D. Whitney, (eds.), Concurrent Design of Products and Processes, McGraw-Hill, 1989."},{"key":"61_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Sch\u00e4ffer","year":"1989\/1990","unstructured":"A.A. Sch\u00e4ffer, Optimal node ranking of trees in linear time, Information Processing Letters 33 (1989\/1990), 91\u201396.","journal-title":"Information Processing Letters"},{"key":"61_CR21","volume-title":"Memorandum No.1132","author":"P. Scheffler","year":"1993","unstructured":"P. Scheffler, Node ranking and Searching on Graphs (Abstract), in: U. Faigle and C. Hoede, (eds.), 3rd Twente Workshop on Graphs and Combinatorial Optimisation, Memorandum No.1132, Faculty of Applied Mathematics, University of Twente, The Netherlands, 1993."},{"key":"61_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"A. Sen","year":"1992","unstructured":"A. Sen, H. Deng and S. Guha, On a graph partition problem with application to VLSI layout, Information Processing Letters 43 (1992), 87\u201394.","journal-title":"Information Processing Letters"},{"key":"61_CR23","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"J. Spinrad, On comparability and permutation graphs, SIAM Journal on Computing 14 (1985), 658\u2013670.","journal-title":"SIAM Journal on Computing"},{"key":"61_CR24","unstructured":"P. de la Torre, R. Greenlaw and A. A. Sch\u00e4ffer, Optimal ranking of trees in polynomial time, Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 1993, pp. 138\u2013144."},{"key":"61_CR25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"M. Yannakakis, The complexity of the partial order dimension problem, SIAM Journal on Algebraic and Discrete Methods 3 (1982), 351\u2013358.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"61_CR26","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(93)90188-F","volume":"46","author":"M.-S. Yu","year":"1993","unstructured":"M.-S. Yu, L.Y. Tseng and S.-J. Chang, Sequential and Parallel algorithms for the maximum-weight independent set problem on permutation graphs, Information processing Letters 46 (1993), 7\u201311.","journal-title":"Information processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_187.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:03Z","timestamp":1605629643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_187","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}