English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hagerup, Torben1, Author           
Katajainen, Jyrki, Author
Nishimura, Naomi, Author
Ragde, Prabhakar, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: New York : asm-Press
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517687
Other: Local-ID: C1256428004B93B8-0F6E68AE7F9F5DFAC125645A00476913-Hagerup-et-al-2-95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: San Francisco, California, USA
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York : asm-Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 641 - 649 Identifier: -