77 search results - page 8 / 16 » Contractions of Planar Graphs in Polynomial Time |
161
Voted
FOCS
2009
IEEE
16 years 10 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
160
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
157
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
168
click to vote
CSR
2009
Springer
16 years 5 days 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...
137
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...