Decision tree complexity of graph properties with dimension at most 5-Reference-Cited by-同舟云学术

Decision tree complexity of graph properties with dimension at most 5

Published:2000-09 Issue:5 Volume:15 Page:416-422
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. & Technol.

Author:

Gao Suixiang,Lin Guohui

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02950404.pdf

Reference8 articles.

1. Rosenberg A L. On the time required to recognize properties of graphs: A problem.SIGACT News, 1973, 5(1): 15–16.

2. Kahn J, Saks M, Strutevant D. A topological approach to evasiveness.Combinatorica, 1984, 4(2): 297–306.

3. Bollobas B. Complete subgraphs are elusive.J. Combinatorial Theory (Ser. B), 1976, 21(2): 1–7.

4. Kirkpatrick D. Determining graph properties from matrix representations. InProceedings of 6th SIGACT Conference, Seattle 1974,ACM, 1975, pp.84–90.

5. 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.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive;ACM Transactions on Computation Theory;2019-06-03

2. Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive;Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science;2015-01-11

3. On the elusiveness of Hamiltonian property;Acta Mathematicae Applicatae Sinica;2001-01