3267 search results - page 145 / 654 » Generalized quasirandom graphs |
146
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
128
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
145
click to vote
AIRWEB
2007
Springer
15 years 10 months ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
186
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
122
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...