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: 517729.0, MPI für Informatik / Algorithms and Complexity Group
All-Pairs Min-Cut in Sparse Networks
Authors:Arikati, Srinivasa Rao; Chaudhuri, Shiva; Zaroliagis, Christos
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):1995
Title of Proceedings:Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference
Start Page:363
End Page:376
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Bangalore, India
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
1995-12-18
End Date of Conference/Meeting 
 (YYYY-MM-DD):
1995-12-20
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-3919FBCEB2ABD315C125645900388276-...
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.