1949 search results - page 143 / 390 » Random graphs on surfaces |
181
click to vote
COMGEO
2012
ACM
14 years 8 days ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
111
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
164
click to vote
SLS
2007
Springer
15 years 10 months ago
2007
Springer
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...
145
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
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 ...
119
click to vote
SPAA
2000
ACM
15 years 9 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...