de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Polynomial Time Algorithms For Network Information Flow

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45344

Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44368

Egner,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2DC0-5
Abstract
There is no abstract available