415 search results - page 50 / 83 » Optimal query complexity bounds for finding graphs |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
AAAI
2004
13 years 9 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...