Buscar
Mostrando ítems 1-10 de 397
Strong cliques and equistability of EPT graphs
(Elsevier Science, 2016-04)
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-intersection graphs of paths in a tree. This result generalizes a previously known characterization of equistable line graphs. ...
AN AND OR-GRAPH APPROACH FOR 2-DIMENSIONAL CUTTING PROBLEMS
(Elsevier Science BvAmsterdamHolanda, 1992)
Links Between Image Segmentation Based on Optimum-Path Forest and Minimum Cut in Graph
(SpringerDordrechtHolanda, 2009)
Image segmentation through combined methods: Watershed transform, unsupervised distance learning and normalized cut
(2014-01-01)
Research on image processing has shown that combining segmentation methods may lead to a solid approach to extract semantic information from different sort of images. Within this context, the Normalized Cut (NCut) is usually ...
Exact Algorithms for the Vertex Separator Problem in Graphs
(Wiley-blackwellMaldenEUA, 2011)
Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking
(IEEE-Inst Electrical Electronics Engineers IncPiscataway, 2012)
Improved analysis of a max-cut algorithm based on spectral partitioning
(SIAM, 2015)
Trevisan [SIAM J. Comput., 41 (2012), pp. 1769-1786] presented an algorithm for Max-Cut based on spectral partitioning techniques. This is the first algorithm for Max-Cut with an approximation guarantee strictly larger ...
A graph-based approach for contextual image segmentation
(2017-01-10)
Image segmentation is one of the most important tasks in Image Analysis since it allows locating the relevant regions of the images and discarding irrelevant information. Any mistake during this phase may cause serious ...