349 search results - page 19 / 70 » Recursive Path Orderings Can Also Be Incremental |
WAW
2004
Springer
14 years 26 days ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
ALT
2001
Springer
14 years 4 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
VSMM
2007
Springer
14 years 1 months ago
2007
Springer
Nowadays, more Virtual Environments (VEs) are becoming available on the Web. This means that VEs are becoming accessible to a larger and more diverse audience. It also means that i...
ICNP
2002
IEEE
14 years 14 days ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...