An NC Algorithm for Computing a Maximal Independent Set in a Hypergraph of Bounded Valence

• Material Type: 文書・図像類
• Title: An NC Algorithm for Computing a Maximal Independent Set in a Hypergraph of Bounded Valence
• Author/Editor: 正代, 隆義; 宮野, 悟
• Author Heading: 正代, 隆義; 宮野, 悟
• Publication, Distribution, etc.: Research Institute of Fundamental Information Science, Kyushu University
• Publication Date: 1993-04-18
• Publication Date (W3CDTF): 1993-04-18
• Periodical title: RIFIS Technical Report
• No. or year of volume/issue: 68
• Volume: 68
• Text Language Code: eng
• Target Audience: 一般
• Access Restrictions: インターネット公開
• Related Material: RIFIS Technical Report || 68 || p1-7; http://www.i.kyushu-u.ac.jp/research/report.html
• Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）; https://irdb.nii.ac.jp
• Original Data Provider (Database): 九州大学 : 九州大学学術情報リポジトリ

• Summary, etc.: Let H = (V, E) be a hypergraph. The valence of a vertex $ upsilon \varepsilon $ V is the number of hyperedges which contain $/upsilon $. We give an NC...