Finding and updating depth-first spanning trees of acyclic digraphs in parallel

被引：0
|
作者：
机构：
[1] Chaudhuri, P.
来源：
Chaudhuri, P. | 1600年 / 33期
关键词：
14;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 44 条
  • [21] Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs
    Zhou, JJ
    Müller, M
    INFORMATION PROCESSING LETTERS, 2003, 88 (04) : 195 - 200
  • [22] PLANAR STRONG CONNECTIVITY HELPS IN PARALLEL DEPTH-FIRST SEARCH
    KAO, MY
    SIAM JOURNAL ON COMPUTING, 1995, 24 (01) : 46 - 62
  • [23] Parallel Nested Depth-First Searches for LTL Model Checking
    Evangelista, Sami
    Petrucci, Laure
    Youcef, Samir
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2011, 6996 : 381 - 396
  • [24] PARALLEL ALGORITHMS FOR COMPUTING MAXIMAL INDEPENDENT SETS IN TREES AND FOR UPDATING MINIMUM SPANNING-TREES
    JUNG, H
    MEHLHORN, K
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 227 - 236
  • [25] A depth-first search algorithm based implementation approach of spanning tree in power system
    Tao, Hua
    Yang, Zhen
    Zhang, Min
    Yang, Jun-Xin
    He, Ren-Mu
    Shi, Yan
    Dianwang Jishu/Power System Technology, 2010, 34 (02): : 120 - 124
  • [26] A Work-Efficient Algorithm for Parallel Unordered Depth-First Search
    Acar, Umut A.
    Chargueraud, Arthur
    Rainey, Mike
    PROCEEDINGS OF SC15: THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2015,
  • [27] A Depth-first Algorithm of Finding All Association Rules Generated by a Frequent Itemset
    武坤
    姜保庆
    魏庆
    Journal of DongHua University, 2006, (06) : 1 - 4
  • [28] Finding multi-constrained feasible paths by using depth-first search
    Zhenjiang Li
    J. J. Garcia-Luna-Aceves
    Wireless Networks, 2007, 13 : 323 - 334
  • [29] Depth-first K-nearest neighbor finding using the MaxNearestDist estimator
    Samet, H
    12TH INTERNATIONAL CONFERENCE ON IMAGE ANALYSIS AND PROCESSING, PROCEEDINGS, 2003, : 486 - 491
  • [30] A depth-first algorithm of finding all association rules generated by a frequent itemset
    Institute of Data and Knowledge Engineering, Henan University, Kaifeng 475001
    不详
    不详
    J. Donghua Univ., 2006, 6 (1-4+9):
12345