3267 search results - page 394 / 654 » Generalized quasirandom graphs |
228
click to vote
WIDM
2005
ACM
16 years 6 days ago
2005
ACM
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
158
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
178
click to vote
SIGIR
2004
ACM
16 years 2 days ago
2004
ACM
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
197
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
193
click to vote
DDEP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...