151 search results - page 19 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
151
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
101
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
167
Voted
MOBICOM
2010
ACM
15 years 4 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
149
Voted
CCCG
2009
15 years 5 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
110
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...