2283 search results - page 290 / 457 » Bounds of Graph Characteristics |
173
click to vote
AIRWEB
2005
Springer
16 years 18 days ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
163
click to vote
CSCLP
2005
Springer
16 years 15 days ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
178
click to vote
SAT
2004
Springer
16 years 12 days ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
200
Voted
FOCS
2003
IEEE
16 years 10 days ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
170
click to vote
FSTTCS
2003
Springer
16 years 8 days ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...