Minimal functional routes in directed graphs with dependent edges
From MaRDI portal
Publication:4924061
DOI10.1111/itor.12007zbMath1270.90094MaRDI QIDQ4924061
Zhongyao Sun, Rui-Sheng Wang, Réka Albert
Publication date: 30 May 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12007
90C35: Programming involving graphs or networks
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- The combined effect of connectivity and dependency links on percolation of networks
- On approximating the longest path in a graph
- Finding the \(K\) shortest hyperpaths
- Directed hypergraphs and applications
- An approximation algorithm for computing longest paths.
- A note on minimum makespan assembly plans
- On fast path-finding algorithms in AND-OR graphs
- Hypernetworks in a directed hypergraph
- Graph Algorithms for Functional Dependency Manipulation
- On the k Shortest Simple Paths Problem in Weighted Directed Graphs
- Enumerating all simple paths in a graph
- Finding the k Shortest Paths
- Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm