We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 15 Issue 5
September  2000
Turn off MathJax
Article Contents
Related Articles
GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most 5[J]. Journal of Computer Science and Technology, 2000, 15(5).
Citation: GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most 5[J]. Journal of Computer Science and Technology, 2000, 15(5).
shu

Decision Tree Complexity of Graph Properties with Dimension at Most 5

More Information
  • Published Date: September 09, 2000
    Abstract
    • FullText(HTML)
    • References (0)
    • Relative Articles

  • Related Articles

    [1]Ji-Gang Wu, Thambipillai Srikanthan, Guang-Wei Zou. New Model and Algorithm for Hardware/Software Partitioning[J]. Journal of Computer Science and Technology, 2008, 23(4): 644-651.
    [2]Qi Ge, Hai-Tao Wang, Hong Zhu. An Improved Algorithm for Finding the Closest Pair of Points[J]. Journal of Computer Science and Technology, 2006, 21(1): 27-31.
    [3]Dao-Yun Xu, Zhi-Hong Tao. Complexities of Homomorphism and Isomorphism for Definite Logic Programs[J]. Journal of Computer Science and Technology, 2005, 20(6): 758-762.
    [4]ZHU Daming, LUAN Junfeng, MA Shaohan. Hardness and Methods to Solve CLIQUE[J]. Journal of Computer Science and Technology, 2001, 16(4).
    [5]GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most5[J]. Journal of Computer Science and Technology, 2000, 15(5): 416-422.
    [6]JIANG Tao, LI Ming, Paul M.B. Average-Case Analysis of Algorithms Using Kolmogorov Complexity[J]. Journal of Computer Science and Technology, 2000, 15(5): 402-408.
    [7]WU Jigang, JI Yongchang, CHEN Guoliang. An Optimal Online Algorithm for Half Plane Intersection[J]. Journal of Computer Science and Technology, 2000, 15(3): 295-299.
    [8]GAO Xiaoshan, ZHU Changcai. Automated Generation of Kempe Linkageand Its Complexity[J]. Journal of Computer Science and Technology, 1999, 14(5): 460-467.
    [9]Lu Xuemiao. On the Complexity of Induction of Structural Descriptions[J]. Journal of Computer Science and Technology, 1987, 2(1): 12-21.
    [10]Huang Xuedong, Cai Lianhong, Fang Ditang, Chi Bianjin, Zhou Li, Jiang Li. A Computer System for Chinese Character Speech Input[J]. Journal of Computer Science and Technology, 1986, 1(4): 75-83.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (8) PDF downloads (1244) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return