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 条
  • [1] FINDING AND UPDATING DEPTH-1ST SPANNING-TREES OF ACYCLIC DIGRAPHS IN PARALLEL
    CHAUDHURI, P
    COMPUTER JOURNAL, 1990, 33 (03): : 247 - 251
  • [2] Algorithms for finding and updating minimum-depth spanning trees in parallel
    Chaudhuri, P
    Ismaeel, AA
    INFORMATION SCIENCES, 1995, 87 (1-3) : 171 - 183
  • [3] A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
    Chen, HC
    Wang, YL
    INFORMATION PROCESSING LETTERS, 1997, 63 (01) : 13 - 18
  • [4] Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
    Sam, Emmanuel
    Bergougnoux, Benjamin
    Golovach, Petr A.
    Blaser, Nello
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023, 14292 : 392 - 405
  • [5] Parallel Depth-First Search for Directed Acyclic Graphs
    Naumov, Maxim
    Vrielink, Alysson
    Garland, Michael
    PROCEEDINGS OF IA3 2017: SEVENTH WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHMS, 2017,
  • [6] EDGE-DISJOINT SPANNING TREES AND DEPTH-FIRST SEARCH
    TARJAN, RE
    ACTA INFORMATICA, 1976, 6 (02) : 171 - 185
  • [7] An optimal algorithm for finding depth-first spanning tree on permutation graphs
    Sukumar Mondal
    Madhumangal Pal
    Tapan K. Pal
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 493 - 500
  • [8] Depth-First Reasoning on Trees
    Limon, Yensen
    Barcenas, Everardo
    Benitez-Guerrero, Edgard
    Auxilio Medina, Maria
    COMPUTACION Y SISTEMAS, 2018, 22 (01): : 189 - 201
  • [9] An Efficient Parallel Ordered Depth-First Search Strategy for Directed Acyclic Graphs
    Yan, Chuqi
    Huang, Jianqiang
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2025, 37 (4-5):
  • [10] PARALLEL-DEPTH SEARCH FOR ACYCLIC DIGRAPHS
    BONGIOVANNI, G
    PETRESCHI, R
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 7 (02) : 383 - 390
12345