Partitioning a weighted graph to connected subgraphs of almost uniform size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3353, Issue , 2004, Pages 365-376

  Ito, Takehiro ^a   Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED COMPONENT; CONNECTED SUBGRAPH; GRAPH G; INTEGER WEIGHTS; NONNEGATIVE INTEGERS; P-PARTITIONS; PARTITION PROBLEM; SERIES-PARALLEL GRAPH; UNIFORM SIZE; WEIGHTED GRAPH; CONNECTED SUBGRAPHS; NUMBER OF COMPONENTS; PARTIAL K-TREES;

TREES (MATHEMATICS); GRAPH THEORY;

FORESTRY; TREES (MATHEMATICS);

EID: 33644607368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_31     Document Type: Article

References (11)

1. S. Arnborg and J. Lagergren. Easy problem for tree-decomposable graphs. J. Algorithms, Vol. 12, No. 2, pp. 308-340, 1991.
2. H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms, Vol. 11, No. 4, pp. 631-643, 1990.
3. B. Bozkaya, E. Erkut and G. Laporte. A tabu search heuristic and adaptive memory procedure for political districting. European J. Operational Research, Vol. 144, pp. 12-26, 2003.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
5. R. C. Gonzales and P. Wintz. Digital Image Processing. Addison-Wesley, Reading, MA, 1977.
6. S. Kundu and J. Misra. A linear tree-partitioning algorithm. SIAM J. Comput., Vol. 6, pp. 131-134, 1977.
7. M. Lucertini, Y. Perl and B. Simeone. Most uniform path partitioning and its use in image processing. Discrete Applied Mathematics, Vol. 42, pp. 227-256, 1993.
8. Y. Perl and S. R. Schach. Max-min tree-partitioning. J. ACM, Vol. 28, pp. 5-15, 1981.
9. K. Takamizawa, T. Nishizeki and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM, Vol. 29, No. 3, pp. 623-641, 1982.
10. D. G. Tsichritzis and P. A. Bernstein. Operating Systems. Academic Press, New York, 1981.
11. J. C. Williams Jr. Political redistricting: a review. Papers in Regional Science, Vol. 74, pp. 12-40, 1995.