|
| Keyword : maximum partition problem
| |
|
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size
Takehiro ITO Kazuya GOTO Xiao ZHOU Takao NISHIZEKI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2 ;
pp. 449-456
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword:
algorithm, choice partition, lower bound, maximum partition problem, minimum partition problem, multi-weighted graph, partial k-tree, series-parallel graph, uniform partition, upper bound, | | | Summary | Full Text:PDF | |
|
|