1477 search results - page 101 / 296 » On Graph Problems in a Semi-streaming Model |
116
click to vote
WG
2000
Springer
15 years 8 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
163
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
115
click to vote
FSEN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
164
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
114
click to vote
UAI
2004
15 years 5 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...