166 search results - page 13 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
EJC
2008
13 years 7 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
ICS
2009
Tsinghua U.
14 years 9 days ago
2009
Tsinghua U.
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
SSD
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
CATA
2000
13 years 9 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...