Sciweavers

165 search results - page 1 / 33
» Parameterizing Cut Sets in a Graph by the Number of Their Co...
Sort
View
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
13 years 8 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
STACS
2010
Springer
13 years 10 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
IPCO
2010
184views Optimization» more  IPCO 2010»
13 years 5 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
IWPEC
2004
Springer
13 years 9 months ago
Parameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Dániel Marx
CVPR
2005
IEEE
14 years 5 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins