80 search results - page 13 / 16 » A simple local 3-approximation algorithm for vertex cover |
IAT
2009
IEEE
15 years 5 months ago
2009
IEEE
We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...
118
click to vote
ITA
2006
15 years 1 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
111
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
162
click to vote
ANTSW
2010
Springer
14 years 12 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
138
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...