AN IMPROVED ALGORITHM FOR TRANSITIVE CLOSURE ON ACYCLIC DIGRAPHS

被引:0
|
作者
SIMON, K
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:376 / 386
页数:11
相关论文
共 50 条
  • [42] ALGORITHMUS 26 - ALGORITHM FOR FINDING TRANSITIVE CLOSURE OF A DIGRAPH
    DZIKIEWICZ, J
    COMPUTING, 1975, 15 (01) : 75 - 79
  • [44] MODIFICATION OF WARSHALLS ALGORITHM FOR TRANSITIVE CLOSURE OF BINARY RELATIONS
    WARREN, HS
    COMMUNICATIONS OF THE ACM, 1975, 18 (04) : 218 - 220
  • [45] Transitive closure algorithm MEMTC and its performance analysis
    Hirvisalo, V
    Nuutila, E
    Soisalon-Soininen, E
    DISCRETE APPLIED MATHEMATICS, 2001, 110 (01) : 77 - 84
  • [46] buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure
    Li, Xiaozhe
    Wang, Xuan
    Zhou, Junfeng
    Du, Ming
    IEEE ACCESS, 2021, 9 : 116528 - 116539
  • [47] Adjacency Matrices of Acyclic Digraphs
    Miller, Victor S.
    AMERICAN MATHEMATICAL MONTHLY, 2012, 119 (04): : 345 - 345
  • [48] DISJOINT PATHS IN ACYCLIC DIGRAPHS
    METZLAR, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 57 (02) : 228 - 238
  • [49] Convex Sets in Acyclic Digraphs
    Balister, Paul
    Gerke, Stefanie
    Gutin, Gregory
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2009, 26 (01): : 95 - 100
  • [50] Acyclic coloring of products of digraphs☆
    Costa, Isnard Lopes
    Silva, Ana Shirley
    DISCRETE APPLIED MATHEMATICS, 2024, 349 : 59 - 69