2612 search results - page 273 / 523 » Switching Graphs and Their Complexity |
170
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
195
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
333
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
155
click to vote
XSYM
2004
Springer
15 years 11 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
127
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...