Algorithms for connectivity problems in undirected graphs maximum flow and minimum κ-way cut

Search by Bookstore

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 博士論文
Title: Algorithms for connectivity problems in undirected graphs maximum flow and minimum κ-way cut
Author/Editor: Matthew S. Levine.
Author Heading: Levine, Matthew S.
Publication, Distribution, etc.: Cambridge : Massachusetts Institute of Technology
Publication Date: 2002.
Extent: 1 microfiche (74 fr.) : negative, ill. ; 11 x 15 cm.
Degree grantor/type: Massachusetts Institute of Technology
Date Granted: 2002.
Date Granted (W3CDTF): 2002
Note (Dissertation): 博士論文
Thesis (doctoral) --Massachusetts Institute of Technology, 2002.
Place of Publication (Country Code): US
Text Language Code: eng
Note (Material Type): [microform]
Note (Bibliography): Includes bibliographies.
Holding library: 国立国会図書館
Call No.: LS-DIMIT-02-120
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000004358355
http://id.ndl.go.jp/bib/000004358355
Bibliographic Record Category (NDL): 216