An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range
スポンサーリンク
概要
- 論文の詳細を見る
- 2013-02-01
著者
-
Chen Hao
The School Of Computer Science University Of Electronic Science And Technology Of China
-
Luo Guangchun
The School Of Computer Science And Engineering University Of Electronic Science And Technology Of China
-
Qin Ke
The School Of Computer Science And Engineering University Of Electronic Science And Technology Of China
-
LUO Guangchun
the School of Computer Science, University of Electronic Science and Technology of China
-
QU Caihui
the School of Computer Science, University of Electronic Science and Technology of China
-
LIU Yuhai
the command automation station of air force
関連論文
- An Optimal Algorithm for Searching the Optimal Translation of Query Windows in Quadtree Decomposition
- Location-Aware Social Routing in Delay Tolerant Networks
- Dynamical Associative Memory : The Properties of the New Weighted Chaotic Adachi Neural Network
- An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range