Sciweavers

268 search results - page 4 / 54
» Finding the k Shortest Paths
Sort
View
CORR
2011
Springer
184views Education» more  CORR 2011»
13 years 2 months ago
Finding Shortest Path for Developed Cognitive Map Using Medial Axis
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
Hazim A. Farhan, Hussein H. Owaied, Suhaib I. Al-G...
W2GIS
2004
Springer
14 years 27 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
COLING
2010
13 years 2 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
COCOON
2001
Springer
14 years 2 days ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin