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 条

[41] SHORTEST TWO DISJOINT PATHS IN POLYNOMIAL TIME
Bjorklun, Andreas
Husfeldt, Thore
SIAM JOURNAL ON COMPUTING, 2019, 48 (06) : 1698 - 1710
[42] Shortest Two Disjoint Paths in Polynomial Time
Bjorklund, Andreas
Husfeldt, Thore
AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 211 - 222
[43] Time complexity of two disjoint simple paths
Razzazi, M.
Sepahvand, A.
SCIENTIA IRANICA, 2017, 24 (03) : 1335 - 1343
[44] New common ancestor problems in trees and directed acyclic graphs
Fischer, Johannes
Huson, Daniel H.
INFORMATION PROCESSING LETTERS, 2010, 110 (8-9) : 331 - 335
[45] 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):
[46] 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
[47] 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)
[48] A Near-Linear Time Algorithm for Computing Replacement Paths in Planar Directed Graphs
Emek, Yuval
Peleg, David
Roditty, Liam
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 428 - 435
[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] 1001 ALGORITHMS FOR PLOTTING PROBLEMS IN DIRECTED GRAPHS
PAIR, C
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 125 - 143

← 1 2 3 4 5 →