Keyword : basically series-parallel directed 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/25
Vol. E76-A  No. 12 ; pp. 2089-2094
Type of Manuscript:  PAPER
Category: Graphs, Networks and Matroids
Keyword: 
probabilistic graphexpected maximum number of vertex-disjoint s-t pathsseries-parallel undirected graphbasically series-parallel directed graphpolynomial time algorithm
 Summary | Full Text:PDF(465.6KB)