O(log^* n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs
スポンサーリンク
概要
- 論文の詳細を見る
- 1993-01-15
著者
-
Miyano Satoru
Research Institute of Fundamental Information Science, Kyushu University
-
Miyano Satoru
Research Institute Of Fundamental Information Science Faculty Of Science Kyushu University
-
Miyano Satoru
Research Institute Of Fundamental Information Science Kyushu University
-
Uchida Tomoyuki
Research Institute of Fundamental Information Science, Kyushu University
-
Uchida Tomoyuki
Research Institute Of Fundamental Information Science Kyushu University
関連論文
- Knowledge Acquisition from Amino Sequences by Machine Learning System BONSAI
- Learning Theory Toward Genome Informatics
- A New Series of $\Delta^p_2$-Complete Problems
- Systematized Approaches to the Complexity of Subgraph Problems
- Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems
- Using Maximal Independent Sets to Solve Problems in Parallel
- O(log^* n) Time Parallel Algorithm for Computing Bounded degree Maximal Subgraphs
- A Parallel Algorithm for the Maximal Co-Hitting Set Problem
- O(log^* n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs
- Complexity of Finding Alphabet Indexing
- O(log^* n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs