Name
Abstract | ||
|---|---|---|
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k= |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.dam.2006.10.012 | Discrete Applied Mathematics |
Keywords | Field | DocType |
partition,tree,algorithm.,optimization problem,uniform edge-partition,n edge,algorithm,connected component | Discrete mathematics,Combinatorics,Minimum degree spanning tree,Tree rotation,K-ary tree,Exponential tree,Connected component,Spanning tree,Partition (number theory),Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
155 | 10 | Discrete Applied Mathematics |
Citations | PageRank | References |
6 | 0.52 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bang Ye Wu | 1 | 336 | 33.89 |
| Hung-Lung Wang | 2 | 27 | 5.63 |
| Shih Ta Kuan | 3 | 6 | 0.52 |
| Kun-mao Chao | 4 | 838 | 94.05 |