[1]
陈洁,张燕平,赵姝. 一种结构化描述方法:保序性与或图[J].南京大学学报:自然科学版, 2013,49(2):235243.
[2] 张嘉惠,崔超艳. 树形WBS在科研项目管理系统中的应用[J]. 计算机系统应用, 2012,21(4):2326.
[3] 吕刚,蒋勇铭,王军. 基于关系型数据库的树形结构设计与实现[J].计算机光盘软件与应用, 2112(17):224225.
[4] 魏斌,马继辉,牛虎.基于递归算法的树型结构图的设计与实现[J]. 计算机应用与软件, 2011,28(1):9698.
[5] 李俊飞,陈皓,赵卫东. 树形结构数据输入输出控件的设计与实现[J]. 计算机工程与设计, 2011,32(9):30543058.
[6] 张华兴,孙毅,单继宏. 网页树形结构自动生成研究[J].计算机系统应用, 2009,18(7):6166.
[7] 李睿,曾俊瑀,周四望. 基于局部标签树匹配的改进网页聚类算法[J]. 计算机应用, 2010,30(3):818820.
[8] 魏纪东,王昭顺,戴桂兰,等. 树形结构数据帧解析和处理[J].小型微型计算机系统, 2010,31(12):22522254.
[9] Marco Di Summa, Andrea Grosso, Marco Locatelli. Complexity of the critical node problem over trees[J]. Computers & Operations Research, 2011,38(12):17661774.
[10]Coudert David, Huc Florian, Mazauric Dorian. A distributed algorithm for computing the node search number in trees[J]. Algorithmica, 2012,63(2):158190.
[11]Dunren Che. An efficient algorithm for tree pattern query minimization under broad integrity constraints[J]. International Journal of Web Information Systems, 2007,24(3):103118.
[12]Yuge T, Tagami K, Yanagi S. Calculating top event probability of a fault tree with many repeated events[J]. Journal of Quality in Maintenance Engineering, 2006,33(4):11261153.
[13]Han K, Feng Y T, Owen D R J. Performance comparisons of treebased and cellbased contact detection algorithms[J]. Engineering Computations, 2007,30(2):247261.
[14]Alfred V Aho, John E Hopcroft, Jeffrey D Ullman. The Design and Analysis of Computer Algorithms[M]. Addison Wesley/Pearson, 2005. |