Using Maximal Independent Sets to Solve Problems in Parallel
スポンサーリンク
概要
著者
-
Miyano Satoru
Research Institute Of Fundamental Information Science Faculty Of Science Kyushu University
-
Shoudai Takayoshi
Department of Control Engineering and Science, Kyushu Institute of Technology
-
Shoudai Takayoshi
Department Of Control Engineering And Science Kyushu Institute Of Technology
関連論文
- A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern
- 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
- Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data
- O(log^* n) Time Parallel Algorithm for Computing Bounded degree Maximal Subgraphs
- A P-Complete Language Describable with Iterated Shuffle
- 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