Polynomial Time Algorithms For Network Information Flow

Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo

Local TagsRelease HistoryDetailsSummary

Polynomial Time Algorithms For Network Information Flow

Sanders, P., Egner, S., & Tolhuizen, L. (2003). Polynomial Time Algorithms For Network Information Flow. In Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03) (pp. 286-294). New York, USA: ACM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2DC0-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2DC2-1

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Sanders, Peter¹, Author
Egner, Sebastian¹, Author
Tolhuizen, Ludo, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-17Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 201945
Other: Local-ID: C1256428004B93B8-B8EA4B673B33DF87C1256D0B00317B75-SET03

Degree: -

Event

show

hide

Title: SPAA 2003

Place of Event: San Diego, USA

Start-/End Date: 2003-06-07 - 2003-06-09

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 286 - 294 Identifier: ISBN: 1581136617