|
| Takehiro ITO
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
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 | |
|
Algorithms for Multicolorings of Partial k-Trees
Takehiro ITO Takao NISHIZEKI Xiao ZHOU | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D
No. 2
pp. 191-200
Type of Manuscript:
Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Graph Algorithms
Keyword:
algorithm, multicoloring, partial k-tree, | | | Summary | Full Text:PDF | |
|
|