Keyword : series-parallel undirected graph

Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph
Peng CHENG  Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/12/20
Vol. E76-A  No. 12  pp. 2089-2094
Type of Manuscript: PAPER
Category: Graphs, Networks and Matroids
Keyword: 
probabilistic graph,  expected maximum number of vertex-disjoint s-t paths,  series-parallel undirected graph,  basically series-parallel directed graph,  polynomial time algorithm, 
  Summary |  Full Text:PDF