Enumerating All Rooted Trees Including k Leaves
スポンサーリンク
概要
- 論文の詳細を見る
- 2010-09-22
著者
-
Otachi Yota
Graduate School Of Information Sciences Tohoku University
-
ISHIKAWA MASANOBU
Department of Computer Science, Gunma University
-
YAMANAKA KATSUHISA
Graduate School of Information Systems, University of Electro-communications
-
NAKANO SHIN-ICHI
Department of Computer Science, Gunma University
関連論文
- Bipartite powers of interval bigraphs
- Enumerating All Rooted Trees Including k Leaves
- Efficient Enumeration of All Pseudoline Arrangements
- Constant Time Generation of Integer Partitions(Discrete Mathematics and Its Applications)
- A DRUG ABSORPTION MODEL OF THE INTESTINAL TRACT BASED ON THE TWO-DIMENSIONAL LAMINAR FLOW IN A CIRCULAR TUBE
- Spanning tree congestion of k-outerplanar graphs (コンピュテーション)
- Computational Complexities of University Interview Timetabling
- Effects of propofol and thiopental on the central nervous system during nociceptive stimulation in cats
- Satellite Cell Differentiation in Goat Skeletal Muscle Single Fiber Culture
- Reconstructing sets from distances given by graphs (コンピュテーション)
- Special Section on Discrete Mathematics and Its Applications
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem (コンピュテーション)
- DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition
- Enumerating All Rooted Trees Including k Leaves