All-Pairs Min-Cut in Sparse Networks

Arikati, Srinivasa Rao; Chaudhuri, Shiva; Zaroliagis, Christos

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331815_2

DetailsSummary

Released

Conference Paper

All-Pairs Min-Cut in Sparse Networks

MPS-Authors

Arikati, Srinivasa Rao
Max Planck Society;

/persons/resource/persons44233

Chaudhuri, Shiva
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis, Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Arikati, S. R., Chaudhuri, S., & Zaroliagis, C. (1995). All-Pairs Min-Cut in Sparse Networks. In P. S. Thiagarajan (Ed.), Foundations of software technology and theoretical computer science (FSTTCS-95): 15th conference (pp. 363-376). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC53-7

Abstract

There is no abstract available