What Makes Equitable Connected Partition Easy
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 122-133
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex CoverLecture Notes in Computer Science, 2009
- On the parameterized complexity of multiple-interval graph problemsTheoretical Computer Science, 2009
- On the Complexity of Some Colorful Problems Parameterized by TreewidthLecture Notes in Computer Science, 2007
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform SizeIEICE Transactions on Information and Systems, 2007
- Improved Parameterized Upper Bounds for Vertex Cover2006
- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform SizeLecture Notes in Computer Science, 2004
- Parameterized Complexity1999
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987
- A partitioning algorithm for minimum weighted Euclidean matchingInformation Processing Letters, 1984