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期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Clustering algorithms - Graphic methods - Data structures

引用

共 50 条

[1] Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Tholey, Torsten
THEORETICAL COMPUTER SCIENCE, 2012, 465 : 35 - 48
[2] Finding disjoint paths on directed acyclic graphs
Tholey, T
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 319 - 330
[3] Parameterized tractability of edge-disjoint paths on directed acyclic graphs
Slivkins, A
ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 482 - 493
[4] PARAMETERIZED TRACTABILITY OF EDGE-DISJOINT PATHS ON DIRECTED ACYCLIC GRAPHS
Slivkins, Aleksandrs
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (01) : 146 - 157
[5] On the connection between the undirected and the Acyclic Directed Two Disjoint Paths Problem
Lucchesi, CL
Giglio, MCMT
ARS COMBINATORIA, 1997, 47 : 191 - 200
[6] A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Wu, Bang Ye
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (06) : 1054 - 1057
[7] Node-Disjoint Paths Problems in Directed Bijective Connection Graphs
Kaneko, Keiichi
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (01): : 93 - 100
[8] Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
Yu, Chih-Chiang
Lin, Chien-Hsin
Wang, Biing-Feng
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (08) : 697 - 708
[9] MULTILEVEL ALGORITHMS FOR ACYCLIC PARTITIONING OF DIRECTED ACYCLIC GRAPHS
Herrmann, Julien
Ozkaya, M. Yusuf
Ucar, Bora
Kaya, Kamer
Catalyurek, Umit, V
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2019, 41 (04): : A2117 - A2145
[10] A linear time algorithm for the induced disjoint paths problem in planar graphs
Kawarabayashi, Ken-ichi
Kobayashi, Yusuke
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (02) : 670 - 680

← 1 2 3 4 5 →