Help
Help
雑誌情報処理学会研究報告
Volume number2004(10) 2004.1.30
ArticleAn O(n log...

An O(n log2 n) Algorithm for the Optimal Sink Location Problem on Dynamic Tree Networks

Icons representing 記事

An O(n log2 n) Algorithm for the Optimal Sink Location Problem on Dynamic Tree Networks

Call No. (NDL)
Z14-1121
Bibliographic ID of National Diet Library
6851397
Material type
記事
Author
間々田 聡子ほか
Publisher
東京 : 情報処理学会
Publication date
2004-01-30
Material Format
Paper
Journal name
情報処理学会研究報告 = IPSJ SIG technical reports 2004(10) 2004.1.30
Publication Page
p.9～16
View All

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
    Check the holdings of this book

Bibliographic Record

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

Paper

Material Type
記事
Title
An O(n log2 n) Algorithm for the Optimal Sink Location Problem on Dynamic Tree Networks
Author/Editor
間々田 聡子
宇野 毅明
牧野 和久 他
Author Heading
間々田 聡子
宇野 毅明
牧野 和久
Alternative Title
木構造の動的ネットワーク上の施設配置問題に対するO(n log2 n)時間アルゴリズム
Periodical title
情報処理学会研究報告 = IPSJ SIG technical reports
No. or year of volume/issue
2004(10) 2004.1.30
Volume
2004
Issue
10
Pages
9～16