A blossom algorithm for maximum edge-disjoint T-paths (Mathematical engineering technical reports ; METR 2019-16)

A blossom algorithm for maximum edge-disjoint T-paths

(Mathematical engineering technical reports ; METR 2019-16)

Publisher: Department of Mathematical Informatics, Graduate School of Information Science and Technology, the University of Tokyo

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: A blossom algorithm for maximum edge-disjoint T-paths
Title Transcription: A blossom algorithm for maximum edge-disjoint T-paths
Author/Editor: Satoru Iwata, Yu Yokoi [著]
Series Title: Mathematical engineering technical reports ; METR 2019-16
Publication, Distribution, etc.: Tokyo : Department of Mathematical Informatics, Graduate School of Information Science and Technology, the University of Tokyo
Publication Date: 2019.8
Publication Date (W3CDTF): 2019
Extent: 14p
Size: 30cm
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: MA21
Target Audience: 一般
Holding library: 国立国会図書館
Call No.: MA21-D8
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 030222332
http://id.ndl.go.jp/bib/030222332
National Bibliography No. (JPNO): 23337747
Cataloging Rule: Nippon Cataloguing Rules 1987 Revised Edition
Bibliographic Record Category (NDL): 111