A generic greedy algorithm, partially-ordered graphs and NP-completeness

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

Volumn 2204, Issue , 2001, Pages 306-316

  Puricella, Antonio ^a   Stewart, Iain A ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

GREEDY ALGORITHMS; HEREDITARY PROPERTY; LINEAR ORDER; NON-TRIVIAL; NP COMPLETE; NP-COMPLETENESS; PARTIAL ORDER; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 23044531350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_28     Document Type: Conference Paper

References (8)

1. Asano, T., Hirata, T.: Edge-deletion and edge-contraction problems. Proceedings of 14th Annual ACM Symposium on the Theory of Computing. (1982) 245-254
2. Berge, C.: Graphs and Hypergraphs. North-Holland (1973)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
4. Gibbons, A.M., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press (1988).
5. Lewis, J.M., Yannakakis, M.: The node deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences. 20 (1980) 219-230
6. Miyano, S.: The lexicographically first maximal subgraph problems: P-completeness and NC algorithms. Mathematical Systems Theory. 22 (1989) 47-73
7. Watanabe, T., Ae, T., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discrete Applied Mathematics. 3 (1981) 151-153
8. Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM Journal of Computing. 10 (1981) 310-327