Linear time algorithms for two disjoint paths problems on directed acyclic graphs

被引:0
|
作者
Institut für Informatik, Universität Augsburg, 86135 Augsburg, Germany [1 ]
机构
来源
Theor Comput Sci | / 35-48期
关键词
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
Clustering algorithms - Graphic methods - Data structures
引用
收藏
相关论文
共 50 条
  • [31] On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
    M. I. Shchekalev
    G. V. Bokov
    V. B. Kudryavtsev
    Moscow University Mathematics Bulletin, 2021, 76 : 35 - 36
  • [32] Max-linear models on directed acyclic graphs
    Gissibl, Nadine
    Klueppelberg, Claudia
    BERNOULLI, 2018, 24 (4A) : 2693 - 2720
  • [33] On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
    Shchekalev, M. I.
    Bokov, G. V.
    Kudryavtsev, V. B.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (01) : 35 - 36
  • [34] Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
    Grossi, Roberto
    Marino, Andrea
    Versari, Luca
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 544 - 557
  • [35] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS
    BORDAT, JP
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197
  • [36] Edge weight reduction problems in directed acyclic graphs
    Hambrusch, SE
    Tu, HY
    JOURNAL OF ALGORITHMS, 1997, 24 (01) : 66 - 93
  • [37] Approximation algorithms for disjoint paths and related routing and packing problems
    Baveja, A
    Srinivasan, A
    MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (02) : 255 - 280
  • [38] Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
    Matúš Mihalák
    Rastislav Šrámek
    Peter Widmayer
    Theory of Computing Systems, 2016, 58 : 45 - 59
  • [39] Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
    Mihalak, Matus
    Sramek, Rastislav
    Widmayer, Peter
    THEORY OF COMPUTING SYSTEMS, 2016, 58 (01) : 45 - 59
  • [40] Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms
    Rosenkrantz, Daniel J.
    Marathe, Madhav, V
    Ravi, S. S.
    Stearns, Richard E.
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 11334 - 11342