Recognizing Greedy Structures

Journal of Algorithms

Volumn 20, Issue 1, 1996, Pages 137-156

  Caro, Yair ^a   Sebo, András ^c   Tarsi, Michael ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

COMBINATORIAL PROBLEM; GRAPH COLOURING; GRAPH MATCHING; GREEDY ALGORITHM; HAMILTONIAN PATH; HEREDITARY SYSTEM; HYPERGRAPH; KNAPSACK PROBLEM; STISFIABILITY PROBLEM;

ALGORITHMS;

EID: 0030361644     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0006     Document Type: Article

References (26)

1. Y. Caro, J. Rojas, and S. Ruiz, A forbidden subgraph characterization and a polynomial algorithm for randomly decomposable graphs Czech. Math. J., to appear.
2. G. Chartrand and H. W. Kronk, Randomly traceable graphs, Siam J. Appl. Math. 16 (1968), 696-700.
3. G. Chartrand, H. V. Kronk, and D. R. Lick, Randomly Hamiltonian digraphs, Fund. Math. 65 (1969), 223-226.
4. V. Chvátal and P. J. Slater, A note on well covered graphs, preprint, 1991.
5. G. Dirac and C. Thomassen, Graphs in which every finite path is contained in a circuit, Math. Ann. 203 (1973), 65-75.
6. D. Dor and M. Tarsi, Graph decomposition is NPC - A complete proof of Holyer's conjecture, in "Proc. 24th Ann. ACM Symp. on Theory of Computing, Victoria, British Columbia, 1992"; SIAM J. Comput., to appear.
7. S. Even, "Graph Algorithms," Computer Science Press, Potomac, MD, 1979.
8. J. F. Fink, Randomly antitraceable digraphs, J. Graph Theory 6 (1982), 481-488.
9. M. R. Garey and D. S. Johnson, "Computers and Intractability, A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
10. A. Gyarfas and J. Lehel, On-line and first fit colorings of graphs, J. Graph Theory 12 (1988), 217-227.
11. P. Helman, B. M. E. Moret, and H. Shapiro, An Exact Characterization of greedy structures, preprint, 1992.
12. D. G. Kirkpatrick and P. Hell, On the completeness of a generalized matching problem, in "Proc. 10th Annual ACM Symposium on Theory of Computing Machinery, New York, 1978."
13. M. Lesk, M. D. Plummer, and W. R. Pulleyblank, Equimatchable graphs, in "Graph Theory and Combinatorics" (B. Bollobàs, Ed.), pp. 239-254, Academic Press, New York/London, 1984.
14. L. Lovàsz and M. D. Plummer, Matching theory, Ann. Discrete Math. 29 (1986).
15. G. J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory Ser. B 28 (1980), 284-304.
16. M. D. Plummer, Well-covered graphs: A survey, preprint, 1992.
17. J. A. Robinson, A machine oriented logic based on the resolution principle, J. Assoc. Comput. Mach. 12 (1965), 23-41.
18. R. S. Sankaranarayana and L. K. Stewart, Complexity results for well covered graphs, Univ. of Alberta, Dept. of Comp. Science, preprint, 1991.
19. D. P. Sumner, Randomly matchable graphs, J. Graph Theory 3 (1979), 183-186.
20. D. Tankus, Greedily Hamiltonian graphs, Tel-Aviv University, unpublished, 1993.
21. D. Tankus and M. Tarsi, Well-covered claw-free graphs, J. Combin. Theory Ser. B, to appear.
22. M. Tarsi, Graphs where every maximal path is maximum, J. Combin. Theory Ser. B, to appear.
23. C. Thomassen, On randomly Hamiltonian digraphs, Math. Ann. 200 (1973), 195-208.
24. C. Thomassen, On Graphs in which every path is contained in a hamiltonian path, J. Reine Angew. Math. 268/269 (1974), 271-282.
25. B. Vizvari, A polynomial algorithm to prove or disprove the optimality of the greedy solution of a Knapsack problem, preprint, 1992.
26. N. Yannakakis, Note and edge-deletion NP-complete problems, in "Proc. 10th Ann. ACM Symp. on Theory of Computing, New York, 1978.