415 search results - page 16 / 83 » Optimal query complexity bounds for finding graphs |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...