2 hits in 0.005 sec.
Polynomial time algorithms for network information flow
[Score: 100%]
Author / Editor: Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo | Place of publication: New York, NY | Publisher: Association for Computing Machinery | Year of Publication: 2003 | 9 s.
Journal / Series / Collection: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Subject Area: Informatik
Author / Editor: Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo | Place of publication: New York, NY | Publisher: Association for Computing Machinery | Year of Publication: 2003 | 9 s.
Journal / Series / Collection: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Subject Area: Informatik
[External link]
Δ-stepping: a parallelizable shortest path algorithm : Delta-stepping: a parallelizable shortest path algorithm; 1
[Score: 100%]
Author / Editor: Meyer, U.; Sanders, Peter | Place of publication: Orlando, Fla. | Publisher: Academic Press | Year of Publication: 2003
Journal / Series / Collection: Journal of algorithms; 49
Subject Area: Mathematik
Author / Editor: Meyer, U.; Sanders, Peter | Place of publication: Orlando, Fla. | Publisher: Academic Press | Year of Publication: 2003
Journal / Series / Collection: Journal of algorithms; 49
Subject Area: Mathematik