2503 search results - page 207 / 501 » A study of 3-arc graphs |
164
click to vote
AIRWEB
2005
Springer
16 years 5 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...
159
click to vote
FOSSACS
2004
Springer
16 years 13 hour ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
163
click to vote
WWW
2010
ACM
15 years 12 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
190
click to vote
FOCS
2003
IEEE
15 years 12 months 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...
144
click to vote
ICALT
2003
IEEE
15 years 12 months ago
2003
IEEE
Visualization of the learning processes is a powerful way to help students to understand their curricula and the structure behind them. CME2 is a prototype software of this favour...