The χt-coloring problem

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

Volumn 900, Issue , 1995, Pages 409-420

  Kaller, Damon ^a   Gupta, Arvind ^a   Shermer, Tom ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COLORING; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; COLORING PROBLEMS; CONNECTED COMPONENT; ISOLATED VERTICES; LINEAR-TIME ALGORITHMS; MONADIC SECOND-ORDER LOGIC; POLYNOMIAL-TIME ALGORITHMS; SCHEDULING THEORY;

GRAPH THEORY;

EID: 84947791219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_92     Document Type: Conference Paper

References (15)

1. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree decomposable graphs. J. Algorithms, 12:308-340, 1991.
2. B. Bollobás and A.J. Harris. List-colourings of graphs. Graphs and Combinatorics, 1:115-127, 1985.
3. M.W. Bern, E.L. Lawler, and A.L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216-235, 1987.
4. H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. 25 th STOC, pages 226-234, 1993.
5. R.B. Borie, R.G. Parker, and C.A. Tovey. Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-581, 1992.
6. B. Courcelle. The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
7. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
8. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
9. T.R. Jensen and B. Toft. Graph Coloring Problems. Wiley Interscience, 1995.
10. D.G. Kirkpatrick and P. Hell. On the complexity of a generalized matching problem. In Proc. 10 th STOC, pages 240-245, 1978.
11. F. Kitagawa and H. Ikeda. An existential problem of a weight-controlled subset and its application to school timetable construction. Discrete Mathematics, 72:195-211, 1988.
12. V. Lotfi and S. Sarin. A graph coloring algorithm for large scale scheduling problems. Comput. & Ops. Res., 13:27-32, 1986.
13. W. Meyer. Equitable coloring. Amer. Math. Monthly, 80:920-922, 1973.
14. S. Mahajan and J.G. Peters. Algorithms for regular properties in recursive graphs. In Proc. 25 th Ann. Allerton Conf. Communication, Control, Cornput., pages 14-23, 1987.
15. N. Robertson and P.D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309-322, 1986.