| Presentation | 1993/5/27 A Lower Bound of the Expected Maximum Number of Edge-disjoint s-t Paths on Probabilistic Graphs Peng Cheng, Shigeru Masuyama, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | For a probabilistic graph(G=(V,E,s,t),p),where G is an undirected graph with specifed source vertex s and sink vertex t(s≠ t)in which each edge has independent failure probability and each vertex is assumed to be failure-free,and p=(p(e_1),…,p(e_ E >)) i s a vector consisting of failure probabilities p(e_i)′s of all edg es e_i′s in E,we consider the problem of computing the expected ma ximum number Γ_(G,p)> of edge-disjoint s-t paths.It has been know n that this computing problem is NP-hard even if G is restricted to several classes like planar graphs,s-t out-in bitrees and s-t complete multi-stage graphs.In this paper,for a probabilistic graph (G=(V,E,s,t),p),we propose a lower bound of Γ_(G,p)> and sh ow the necessary and sufficient conditions by which the lower bound coincides with Γ_(G,p)>. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | probabilistic graph / edge-diejoint s-t paths / expected maximum number of edge-diejoint s-t paths / lower bourd / NP-hard |
| Paper # | COMP93-7,SS93-1 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1993/5/27(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Lower Bound of the Expected Maximum Number of Edge-disjoint s-t Paths on Probabilistic Graphs |
| Sub Title (in English) | |
| Keyword(1) | probabilistic graph |
| Keyword(2) | edge-diejoint s-t paths |
| Keyword(3) | expected maximum number of edge-diejoint s-t paths |
| Keyword(4) | lower bourd |
| Keyword(5) | NP-hard |
| 1st Author's Name | Peng Cheng |
| 1st Author's Affiliation | Toyohashi University of Technology() |
| 2nd Author's Name | Shigeru Masuyama |
| 2nd Author's Affiliation | Toyohashi University of Technology |
| Date | 1993/5/27 |
| Paper # | COMP93-7,SS93-1 |
| Volume (vol) | vol.93 |
| Number (no) | 81 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |