69 search results - page 9 / 14 » The cover time of sparse random graphs |
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
108
click to vote
SLS
2007
Springer
15 years 4 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...
COR
2000
14 years 9 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
100
click to vote
CN
2010
14 years 6 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...