1133 search results - page 11 / 227 » Basics of Graph Cuts |
GD
2003
Springer
14 years 25 days ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
DAM
2008
13 years 7 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
DAM
2006
13 years 7 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...