Online problems, pathwidth, and persistence

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

Volumn 3162, Issue , 2004, Pages 13-24

  Downey, Rodney G ^a   McCartin, Catherine ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

GRAPH COLORING PROBLEM; NEW PARAMETERS; ON-LINE ALGORITHMS; ON-LINE SETTING; ONLINE PROBLEMS; PATHWIDTH;

ARTIFICIAL INTELLIGENCE;

EID: 33750229827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_2     Document Type: Article

References (18)

1. H. L. Bodlaender, J. Engelfreit: Domino Treewidth. J. Alg. 24, pp 94-127, 1997.
2. M. Chrobak, M. Slusarek: On some packing problems related to dynamic storage allocation. RAIRO Inform. Theor. Appl. 22, pp 487-499, 1988.
3. R. G. Downey, M. R. Fellows: Parameterized Complexity Springer - Verlag, 1999.
4. B. de Fluiter: Algorithms for Graphs of Small Treewidth. ISBN 90-393-1528-0, 1997.
5. J. Fouhy: Computational Experiments on Graph Width Metrics. M.Sc. thesis, Victoria University, Wellington, 2003.
6. A. Gyarfas, J. Lehel: On - line and First Fit Coloring of Graphs. J. Graph Theory, Vol. 12, No. 2, pp 217-227, 1988.
7. S. Irani: Coloring inductive graphs on - line. Proceedings of the 31st Annual Symposium on Foundations of Computer Science, Vol 2, pp 470-479, 1990.
8. H. A. Kierstead: Recursive and On - Line Graph Coloring In Handbook of Recursive Mathematics, Volume 2, pp 1233-1269, Elsevier, 1998.
9. H. A. Kierstead: The Linearity of First Fit Coloring of Interval Graphs. SIAM J. on Discrete Math, Vol 1, No. 4, pp 526-530, 1988.
10. H. A. Kierstead, J. Qin: Coloring interval graphs with First - Fit. (Special issue: Combinatorics of Ordered Sets, papers from the 4th Oberwolfach Conf., 1991), M. Aigner and R. Wille (eds.), Discrete Math. 144, pp 47-57, 1995.
11. H. A. Kierstead, W. A. Trotter: An Extremal Problem in Recursive Combinatorics. Congressus Numeratium 33, pp 143-153, 1981.
12. N. G. Kinnersley: The Vertex Separation Number of a Graph equals its Path - Width. Information processing Letters 42(6), pp. 345-350, 1992.
13. L. M. Kirousis, D. M. Thilikos: The Linkage of a Graph. SIAM Journal on Computing 25(3), pp. 626-647, 1996.
14. L. Lovasz, M. E. Saks, W. A. Trotter: An On - Line Graph Coloring Algorithm with Sublinear Performance Ratio. Bellcore Tech Memorandum, No.TM-ARH-013-014.
15. C. M. McCartin: Contributions to Parameterized Complexity Ph.D. Thesis, Victoria University, Wellington, 2003.
16. N. Robertson, P. D. Seymour: Graph minors H. Algorithmic aspects of tree - width. Journal of Algorithms 7, pp 309-322, 1986.
17. D. D. Sleator, R. E. Tarjan: Amortized Efficiency of List Update and Paging Rules. Comunication of the ACM 28, pp 202-208, 1985.
18. M. Szegedy: private communication, reported in [8].