Rankings of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 903, Issue , 1995, Pages 292-304

  Bodlaender, H L ^a   Deogun, J S ^b   Jansen, K ^c   Kloks, T ^d   Kratsch, D ^e   Muller H ^e   Tuza, Zs ^f  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^c UNIVERSITY OF TRIER   (Germany)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^e FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^f INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

ALGORITHMIC COMPLEXITY; CHROMATIC NUMBER; CLIQUE SIZE; INDUCED SUBGRAPHS; POLYNOMIAL-TIME; RANKING PROBLEMS; TREE-WIDTH; VERTEX-RANKING;

GRAPH THEORY;

EID: 21844482302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59071-4_56     Document Type: Conference Paper

References (27)

1. H.L. BODLAENDER. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1993, pp. 226-234.
2. H.L. BODLAENDER. A tourist guide through treewidth. Acta Cybernetica 11 (1993), 1-23.
3. H.L. BODLAENDER, J.R. GILBERT, H. HAFSTEINSSON, T. KLOKS. Approximating treewidth, pathwidth and minimum elimination tree height. Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG’91, Springer-Verlag, Lecture Notes in Computer Science 570, 1992, pp. 1-12. To appear in Journal of Algorithms.
4. J.A. BONDY, U.S.R. MURTY. Graph Theory with Applications. American Elsevier, New York, 1976.
5. A. BRANDSTADT. Special graph classes - a survey. Schriftenreihe des FB Mathematik, Universität Duisburg, SM-DU-199, 1991.
6. P. DE LA TORRE, R. GREENLAW, A.A. SCHÄFFER. Optimal edge ranking of trees in polynomial time. Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 1993, pp. 138-144.
7. J.S. DEOGUN, T. KLOKS, D. KRATSCH, H. MÜLLER. On vertex ranking for permutation and other graphs. Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, P. Enjalbert, E.W. Mayr, K.W. Wagner, (eds.), Lecture Notes in Computer Science 775, Springer-Verlag, Berlin, 1994, 747-758.
8. J.S. DEOGUN, Y. PENG. Edge ranking of trees. Conqressus Numerantium 79 (1990), 19-28.
9. I.S. DUFF, J.K. REID. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software 9 (1983), 302-325.
10. M.R. GAREY, D.S. JOHNSON. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
11. M.C. GOLUMBIC. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
12. A.V. IYER, H.D. RATLIFF, G. VIJAYAN. Optimal node ranking of trees. Information Processing Letters 28 (1988), 225-229.
13. A.V. IYER, H.D. RATLIFF, G. VIJAYAN. Parallel assembly of modular products-an analysis. Technical Report 88-06, Georgia Institute of Technology, 1988.
14. A.V. IYER, H.D. RATLIFF, G. VIJAYAN. On an edge ranking problem of trees and graphs. Discrete Applied Mathematics 30 (1991), 43-52.
15. M. KATCHALSKI, W. MC CUAIG, S. SEAGER. Ordered colourings. Manuscript, University of Waterloo, 1988.
16. T. KLOKS. Treewidth. Ph. D. Thesis, Utrecht University, The Netherlands, 1993.
17. C.E. LEISERSON. Area efficient graph layouts for VLSI. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 270-281.
18. J.W.H. LIU. The role of elimination trees in sparse factorization. SIAM Journal of Matrix Analysis and Applications 11 (1990), 134-172.
19. J. NEVINS, D. WHITNEY, (eds.) Concurrent Design of Products and Processes. McGraw-Hill, New York, 1989.
20. A. POTHEN. The complexity of optimal elimination trees. Technical Report CS-88-13, Pennsylvania State University, U.S.A., 1988.
21. N. ROBERTSON, P. D. SEYMOUR. Graph minors. IV. Tree-width and well-quasi-ordering. Journal on Combinatorial Theory Series B 48 (1990), 227-254.
22. N. ROBERTSON, P. D. SEYMOUR. Graph minors. V. Excluding a planar graph. Journal on Combinatorial Theory Series B 41 (1986), 92-114.
23. N. ROBERTSON, P. D. SEYMOUR. Graph minors. XIII. The disjoint paths problem. Manuscript, 1986.
24. A.A. SCHAFFER. Optimal node ranking of trees in linear time. Information Processing Letters 33 (1989/90), 91-96.
25. P. SCHEFFLER. Node ranking and searching on graphs (Abstract), in: U. Faigle and C. Hoede, (eds.), 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum No.1132, Faculty of Applied Mathematics, University of Twente, The Netherlands, 1993.
26. A. SEN, H. DENG, S. GUHA. On a graph partition problem with application to VLSI layout. Information Processing Letters 43 (1992), 87-94.
27. E.S. WOLK. The comparability graph of a tree. Proceedings of the American Mathematical Society 3 (1962), 789-795.