Variants of the Graph Connecting Problem and Their Computational Complexity

Journal name: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 103(622) 2004.1.29

Holdings of Libraries in Japan

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

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

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: Variants of the Graph Connecting Problem and Their Computational Complexity
Author/Editor: 西田泰士
守屋悦朗
Author Heading: 西田泰士
守屋悦朗
Alternative Title: 部分グラフ連結化問題による計算量の階層
Periodical title: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue: 103(622) 2004.1.29
Volume: 103
Issue: 622
Pages: 1～7
Publication date of volume/issue (W3CDTF): 2004-01-29
ISSN (Periodical Title): 0913-5685
ISSN-L (Periodical Title): 0913-5685
Publication (Periodical Title): 東京 : 電子情報通信学会
Place of Publication (Country Code): JP
Text Language Code: eng
Subject Heading: グラフ理論的問題
計算量の階層
RL困難
NL完全
NP完全
PSPACE完全
NEXP完全
graph-theoretic problem
hierarchy of complexity classes
RL-hard
NL-complete
NP-complete
PSAPCE-complete
NEXP-complete
NDLC: ZN33
Target Audience: 一般
Report No. (Article): COMP2003-69
Holding library: 国立国会図書館
Call No.: Z16-940
Data Provider (Database): 国立国会図書館 : 国立国会図書館雑誌記事索引
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 6860223
http://id.ndl.go.jp/bib/6860223
Bibliographic Record Category (NDL): 632