Perfectness is an Elusive Graph Property
by Stefan Hougardy, Annegret Wagler
http://www.informatik.hu-berlin.de/~hougardy/paper/elusiv.ps.gz
Add To MetaCart
Abstract:
A graph property is called elusive (or evasive) if every algorithm for testing this property has to read in the worst case n
Citations
| 670 | Extremal Graph Theory – Bollobás - 1978 |
| 77 | Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, Wissenschaftliche Zeitschrift der Martin-Luther-Universität Halle-Wittenberg, Mathematisch-Naturwissenschaftliche Reihe 10 – Berge - 1961 |
| 45 | On recognizing graph properties from adjacency matrices – Rivest, Vuillemin - 1976 |
| 32 | Geometric Algorithms and Combinatorial Optimization – otschel, asz, et al. - 1988 |
| 13 | A topological approach to evasiveness, Combinatorica 4 – Kahn, Saks, et al. - 1984 |
| 6 | Complete subgraphs are elusive – Bollobas - 1976 |
| 6 | Critical Edges in Perfect Graphs – Wagler - 2000 |
| 4 | Some results on elusive graph properties – Triesch - 1994 |
| 3 | A sharpened version – Best, Boas, et al. - 1974 |
| 3 | asz, Normal hypergraphs and the weak perfect graph conjecture – Lov' - 1972 |
| 2 | On Critically Perfect Graphs – Wagler - 1999 |
