415 search results - page 1 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
AI
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
ISTCS
1997
Springer
13 years 8 months ago
1997
Springer
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...