Sciweavers

91 search results - page 19 / 19
» Pathwidth of outerplanar graphs
Sort
View
IWPEC
2009
Springer
14 years 8 days ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...