310 search results - page 20 / 62 » Cutting two graphs simultaneously |
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
JNSM
2006
13 years 9 months ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
MICCAI
2007
Springer
14 years 10 months ago
2007
Springer
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
DM
2006
13 years 9 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...