3267 search results - page 367 / 654 » Generalized quasirandom graphs |
184
click to vote
AH
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
176
click to vote
XSYM
2004
Springer
16 years 1 days 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...
152
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
180
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
188
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...