Decision tree complexity of graph properties with dimension at most 5
- 46 Downloads
A graph property is a set of graphs such that if the set contains some graphG then it also contains each isomorphic copy ofG (with the same vertex set). A graph propertyP onn vertices is said to be elusive, if every decision tree algorithm recognizingP must examine alln(n−1)/2, pairs of vertices in the worst case. Karp conjectured that every nontrivial monotone graph property is elusive. In this paper, this conjecture is proved for some cases. Especially, it is shown that if the abstract simplicial complex of a nontrivial monotone graph propertyP has dimension not exceeding 5, thenP is elusive.
Keywordsmonotone graph property decision tree complexity elusive
Unable to display preview. Download preview PDF.
- Kirkpatrick D. Determining graph properties from matrix representations. InProceedings of 6th SIGACT Conference, Seattle 1974,ACM, 1975, pp.84–90.Google Scholar
- Milner E C, Welsh D J A. On the computational complexity of graph theoretical properties. InProceedings of 5th British Columbia Conf. Combinatorics, 1975, pp.471–487.Google Scholar
- Du D-Z. Decision Tree Theory. Kluwer Academic Publishers, Boston, 1996.Google Scholar
- Bollobas B, Eldridge S E. Problem. InProceedings of Fifth British Combinatorial Conf., Utilitas Math., Winnipeg, C. st. J. A. Nash-Williams, Sheehan J (eds.), 1976, pp. 689–691.Google Scholar