Sciweavers

2310 search results - page 216 / 462
» Coloring Random Graphs
Sort
View
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 2 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
SIGECOM
2010
ACM
140views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Better vaccination strategies for better people
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...
Po-An Chen, Mary David, David Kempe
CPC
2006
116views more  CPC 2006»
13 years 8 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
ICPR
2004
IEEE
14 years 9 months ago
Systematic Static Shadow Detection
A systematic static shadow detection algorithm for color images is presented in this paper. The image is modeled by an undirected graph and the shadow detection is achieved throug...
Jian Yao, Zhongfei (Mark) Zhang
ICIAP
2003
ACM
14 years 8 months ago
A feature-based face recognition system
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determine...
Paola Campadelli, Raffaella Lanzarotti, C. Savazzi