The Complexity of Selecting Maximal Solutions
スポンサーリンク
概要
著者
-
Chen Zhi-zhong
Department Of Computer Science And Information Mathematics University Of Electro-communications
-
Toda Seinosuke
Department of Computer Science, University of Electro-Communications
-
Toda Seinosuke
Department Of Computer Science And System Analysis College Of Humanities And Sciences Nihon Universi
-
Toda Seinosuke
Department Of Computer Science University Of Electro-communications
関連論文
- Parallel Algorithms for Maximal Linear Forests
- Study of Photocurrent Properties of GaN Ultraviolet Photoconductor Grown on 6H-SiC Substrate
- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
- More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling (New Aspects of Theoretical Computer Science)
- The Complexity of Selecting Maximal Solutions
- Finding Maximal Cycle-Free Subgraphs in Parallel(Fundamental Studies on Computational Complexity)
- A Deterministic Approximation Algorithm for Maximum 2-Path Packing
- Grammatical Characterizations of P and PSPACE
- Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size(Invited Papers from New Horizons in Computing)
- A Note on the Length of M-Programs over Nonsolvable Groups
- Parallel Algorithms for the Maximal Tree Cover Problems