O(log*n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs

Publisher: Research Institute of Fundamental Information Science, Kyushu University

Notes on use

Note (General)：: Transactions of Information Processing Society of Japan 34, 16-20, 1993

Related materials as well as pre- and post-revision versions

RIFIS Technical Report

http://www.i.kyushu-u.ac.jp/research/report.html

Search by Bookstore

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

Kyushu University Institutional Repository
Digital
You can check the holdings of institutions and databases with which 学術機関リポジトリデータベース（IRDB）（機関リポジトリ） is linked at the site of 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）.
Kyushu University Institutional Repository

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: O(log*n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs
Author/Editor: 内田, 智之
宮野, 悟
Author Heading: 内田, 智之
宮野, 悟
Publication, Distribution, etc.: Research Institute of Fundamental Information Science, Kyushu University
Publication Date: 1991-06-28
Publication Date (W3CDTF): 1991-06-28
Periodical title: RIFIS Technical Report
No. or year of volume/issue: 34
Volume: 34
Text Language Code: eng
Target Audience: 一般
Note (General): Transactions of Information Processing Society of Japan 34, 16-20, 1993
Format (IMT): application/pdf
Source: rifis-tr-34.pdf
https://catalog.lib.kyushu-u.ac.jp/opac_download_md/3142/rifis-tr-34.pdf
Access Restrictions: インターネット公開
Related Material: RIFIS Technical Report
http://www.i.kyushu-u.ac.jp/research/report.html
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 九州大学 : 九州大学学術情報リポジトリ