7 search results - page 1 / 2 » The computational complexity of graph contractions II: Two t... |
NETWORKS
2008
13 years 4 months ago
2008
NETWORKS
2008
13 years 4 months ago
2008
CSR
2009
Springer
13 years 11 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
ALGORITHMICA
2006
13 years 4 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
WAOA
2005
Springer
13 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...