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 条
  • [21] A linear time algorithm for the arc disjoint menger problem in planar directed graphs
    Brandes, U
    Wagner, D
    ALGORITHMICA, 2000, 28 (01) : 16 - 36
  • [22] A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
    U. Brandes
    D. Wagner
    Algorithmica, 2000, 28 : 16 - 36
  • [23] External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs
    Babenko, Maxim
    Kolesnichenko, Ignat
    SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 295 - 304
  • [24] Counting Approximately-Shortest Paths in Directed Acyclic Graphs
    Mihalak, Matus
    Sramek, Rastislav
    Widmayer, Peter
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2013, 2014, 8447 : 156 - 167
  • [25] Solving shortest paths efficiently on nearly acyclic directed graphs
    Saunders, Shane
    Takaoka, Tadao
    THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 94 - 109
  • [26] Efficient algorithms for pattern matching on directed acyclic graphs
    Chen, L
    Gupta, A
    Kurul, ME
    ICDE 2005: 21ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2005, : 384 - 385
  • [27] Algorithms for the thief orienteering problem on directed acyclic graphs
    Bloch-Hansen, Andrew
    Solis-Oba, Roberto
    Page, Daniel R.
    THEORETICAL COMPUTER SCIENCE, 2025, 1023
  • [28] Shortest path algorithms for nearly acyclic directed graphs
    Takaoka, T
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 367 - 374
  • [29] Shortest path algorithms for nearly acyclic directed graphs
    Takaoka, T
    THEORETICAL COMPUTER SCIENCE, 1998, 203 (01) : 143 - 150
  • [30] A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
    Attiratanasunthron, Nattapat
    Fakcharcienphol, Jittat
    INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 88 - 92
12345