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 条
  • [41] Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs
    Bolelli, Federico
    Grana, Costantino
    IMAGE ANALYSIS AND PROCESSING - ICIAP 2019, PT II, 2019, 11752 : 148 - 158
  • [42] Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms
    Rosenkrantz, Daniel J.
    Marathe, Madhav V.
    Ravi, S. S.
    Stearns, Richard E.
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2024, 16 (02)
  • [43] SHORTEST TWO DISJOINT PATHS IN POLYNOMIAL TIME
    Bjorklun, Andreas
    Husfeldt, Thore
    SIAM JOURNAL ON COMPUTING, 2019, 48 (06) : 1698 - 1710
  • [44] Shortest Two Disjoint Paths in Polynomial Time
    Bjorklund, Andreas
    Husfeldt, Thore
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 211 - 222
  • [45] Time complexity of two disjoint simple paths
    Razzazi, M.
    Sepahvand, A.
    SCIENTIA IRANICA, 2017, 24 (03) : 1335 - 1343
  • [46] New common ancestor problems in trees and directed acyclic graphs
    Fischer, Johannes
    Huson, Daniel H.
    INFORMATION PROCESSING LETTERS, 2010, 110 (8-9) : 331 - 335
  • [47] A nettree for simple paths with length constraint and the longest path in directed acyclic graphs
    Wu, Y.-X. (wuc567@163.com), 2012, Science Press (35):
  • [48] Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
    Lauri, Mikko
    Ropponen, Aino
    Ritala, Risto
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2017, 79 (04) : 337 - 370
  • [49] Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
    Mikko Lauri
    Aino Ropponen
    Risto Ritala
    Annals of Mathematics and Artificial Intelligence, 2017, 79 : 337 - 370
  • [50] A Near-Linear-Time Algorithm for Computing Replacement Paths in Planar Directed Graphs
    Emek, Yuval
    Peleg, David
    Rodity, Liam
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (04)
12345