FOCS 1995 Annual IEEE Symposium on Foundations of Computer Science
 |  |
Wall of Fame | Most Viewed FOCS-1995 Paper
FOCS
1995
IEEE
13 years 8 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 132 | ||
| 2 | | 119 | ||
| 3 | | 116 | ||
| 4 | | 106 | ||
| 5 | | 104 | ||
| 6 | | 101 | ||
| 7 | | 87 | ||
| 8 | | 86 | ||
| 9 | | 85 | ||
| 10 | | 84 | ||
| 11 | | 78 | ||
| 12 | | 77 | ||
| 13 | | 63 |