Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 517687.0, MPI für Informatik / Algorithms and Complexity Group
Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
Authors:Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar
Language:English
Publisher:asm-Press
Place of Publication:New York
Date of Publication (YYYY-MM-DD):1995
Title of Proceedings:6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)
Start Page:641
End Page:649
Place of Conference/Meeting:San Francisco, California, USA
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-0F6E68AE7F9F5DFAC125645A00476913-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.