Help
Help
雑誌電子情報通信学会技術研究報告 : 信学技報
Volume number111(494)-111(500):2012.3.16-2012.3.30
ArticleComputing ...

Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth (コンピュテーション)

Icons representing 記事

Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth

(コンピュテーション)

Call No. (NDL)
Z16-940
Bibliographic ID of National Diet Library
023574375
Material type
記事
Author
安藤 映ほか
Publisher
東京 : 電子情報通信学会
Publication date
2012-03-16
Material Format
Paper
Journal name
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111(494):2012.3.16
Publication Page
p.23-29
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
Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth
Author/Editor
安藤 映
Joseph Peters
Series Title
コンピュテーション
Author Heading
安藤 映
Joseph Peters
Alternative Title
指数分布に従う枝長さと小さな木幅を持つ無向グラフ上での二点間の確率的な最短路長さの計算方法 シスウ ブンプ ニ シタガウ エダ ナガサ ト チイサナ モクハバ オ モツ ムコウ グラフ ジョウ デ ノ ニテン カン ノ カクリツテキ ナ サイタンロ ナガサ ノ ケイサン ホウホウ
Periodical title
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue
111(494):2012.3.16
Volume
111
Issue
494