Buscar
Mostrando ítems 1-3 de 3
Ponencia
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2010)
The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S ...
Artículo
A parallel Homological Spanning Forest framework for 2D topological image analysis
(Elsevier, 2016)
In [14], a topologically consistent framework to support parallel topological analysis and recognition for2 D digital objects was introduced. Based on this theoretical work, we focus on the problem of findingefficient ...
Ponencia
Color Segmentation Of 2D Images With Thresholding
(Springer, 2012)
Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform computations by applying a finite set of rules in a synchronous, maximally parallel way. In this paper, ...