Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a polynomial time algorithm for computing the expected maximum number of vertex-disjoint s-t paths in a probabilistic basically series-parallel directed graph and a probabilistic series-parallel undirected graph with distinguished source s and sink t(s t), where each edge has a mutually independent failure probability and each vertex is assumed to be failure-free.
- 社団法人電子情報通信学会の論文
- 1993-12-25
著者
-
Cheng Peng
The Department Of Knowledge-based Information Engineering Toyohashi University Of Technology
-
Masuyama Shigeru
The Department Of Knowledge-based Information Engineering Toyohashi University Of Technology
関連論文
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph
- Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph
- What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? : Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples(Special Issue on Algorithm Engineering : Surveys)
- An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
- Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph(Special Section on Discrete Mathematics and Its Applications)