Characterizations of k-Terminal Flow Networks and Computing Network Flows in 
Partial k-Trees

Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees

MPS-Authors

/persons/resource/persons44564

Hagerup, Torben
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

Hagerup, T., Katajainen, J., Nishimura, N., & Ragde, P. (1995). Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. In 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95) (pp. 641-649). New York: asm-Press.

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

Abstract

There is no abstract available