Greedy algorithms, H-colourings and a complexity-theoretic dichotomy

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1897-1913

  Puricella, Antonio ^a   Stewart, Iain A ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

DICHOTOMY RESULTS; GREEDY ALGORITHMS; NOCV1; NP COMPLETE; P-COMPLETE; STANDARD H; SUBGRAPHS; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 85009164515     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00329-8     Document Type: Article

References (12)

1. [1] Berge, C., Graphs and Hypergraphs, 1973, North-Holland, Amsterdam.
2. [2] J. Dı́az, M. Serna, D.M. Thilikos, (H,C,K)-colorings: fast, easy and hard cases, Proc. 26th Internat. Symp. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 304–315.
3. [3] Dyer, M., Greenhill, C., The complexity of counting graph homomorphisms. Random Struct. Algorithms 17 (2000), 260–289.
4. [4] Feder, T., Hell, P., List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B 72 (1998), 236–250.
5. [5] Feder, T., Hell, P., Huang, J., List homomorphisms and circular arc graphs. Combinatorica 19 (1999), 487–505.
6. [6] Hell, P., Nesetril, J., On the complexity of H-colouring. J. Combin. Theory Ser. B 48 (1990), 92–110.
7. [7] Johnson, D.S., Yannakakis, M., Papadimitriou, C.H., On generating all maximal independent sets. Inform. Process. Lett. 27 (1988), 119–123.
8. [8] Miyano, S., The lexicographically first maximal subgraph problems: P-completeness and NC algorithms. Math. Syst. Theory 22 (1989), 47–73.
9. p-complete lexicographically first maximal subgraph problems. Theoret. Comput. Sci. 88 (1991), 33–57.
10. [10] Papadimitriou, C.H., Computational Complexity, 1994, Addison-Wesley, Reading, MA.
11. [11] A. Puricella, I.A. Stewart, A generic greedy algorithm, partially-ordered graphs and NP-completeness, Proc. 27th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2204, Springer, Berlin, 2001, pp. 306–316.
12. [12] Stewart, I.A., Complete problems involving Boolean labelled structures and projection translations. J. Logic Comput. 1 (1991), 861–882.