3471 search results - page 160 / 695 » Obstacle Numbers of Graphs |
127
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Annotation of sequences that share little similarity to sequences of known function remains a major obstacle in genome annotation. Some of the best methods of detectin...
157
Voted
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ESA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
143
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
148
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...