553 search results - page 88 / 111 » Cover Contact Graphs |
80
Voted
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
93
Voted
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
76
Voted
MP
2007
14 years 9 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
122
Voted
ANTSW
2010
Springer
14 years 8 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...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...