Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 365-376
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A tabu search heuristic and adaptive memory procedure for political districtingEuropean Journal of Operational Research, 2003
- Most uniform path partitioning and its use in image processingDiscrete Applied Mathematics, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Max-Min Tree PartitioningJournal of the ACM, 1981
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977