P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 286--294, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Low Complexity Algebraic Multicast Network Codes - Jaggi, Chou, Jain (2003) (1 citation) (Correct)
....combinations (over m ) of the symbols on incoming edges to obtain symbols on outgoing edges. They show that for 2 NC there exist m linear networks which solve the network coding problem (G; s; R; C) Our main results, many of which were independently and concurrently discovered by [3], are as follows Theorem 1 (Network Multicast Algorithm) For m = dlog 2 Ne and any R C, there exist IF2 which solve the multicast network coding problem (G; s; R; R) Outline of Proof: We provide a polynomial time construction for the solution. The network is decomposed into R edgedisjoint ....
P. Sanders, S. Egner, L. Tolhuizen, \Polynomial Time Algorithms for Network Information Flow", Proc. of the 15th ACM Symposium on Parallelism in Algorithms and Architectures.
On the Utility of Network Coding in Dynamic Environments - Ho, Leong, Medard.. (2004) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 286--294, 2003.
On Achieving Optimal Throughput with Network Coding - Li, Li, Jiang, Lau (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003.
On the Capacity of Network Coding for Random Networks - Ramamoorthy, Shi, Wesel (2003) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, Polynomial Time Algorithms for Network Information Flow, Proceedings SPAA, 2003.
Network Coding: The Case of Multiple Unicast Sessions - Li, Li (2004) (1 citation) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003.
On the Utility of Network Coding in Dynamic Environments - Ho, Leong, Medard.. (2004) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 286--294, 2003.
On Randomized Network Coding - Ho, Medard, Shi, Effros, Karger (2003) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithms For Network Information Flow", In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 286-294, 2003.
Linear Network Codes: A Unified Framework for.. - Effros, Medard.. (2003) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, Polynomial time algorithms for network information flow, Proc. of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003, To appear.
On Achieving Optimal End-to-End Throughput in Data.. - Li, Li, Jiang, Lau (2004) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003.
Bounds on Linear Codes for Network Multicast - Tavory, Feder, Ron (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA'03), 2003.
Network Coding for Correlated Sources - Ho, Médard, Effros, Koetter (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 286--294, 2003.
Network Coding in Undirected Networks - Li, Li (2004) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithm for Network Information Flow," in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, 2003.
Network Coding from a Network Flow Perspective - Ho, Karger, Medard, Koetter (2003) (1 citation) (Correct)
No context found.
P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithms For Network Information Flow".
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC