Searching for "Polynomial time algorithms for network information flow." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Polynomial Time Algorithms for Network Information Flow
by Peter Sanders, Sebastian Egner, Ludo Tolhuizen — 2003 — in 15th ACM Symposium on Parallel Algorithms and Architectures
…Polynomial Time Algorithms for Network Information Flow Peter Sanders MPI Informatik…
Cited by 61 (1 self) – Add To MetaCart

On the Network Coding Advantage for Wireless Multicast in Euclidean Space 1
by Ashish Goel, Sanjeev Khanna
…-Interscience, 1995. [13] P. Sanders, S. Egner, and L. M. G. M. Tolhuizen. Polynomial time algorithms for network…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB