Sciweavers

313 search results - page 7 / 63
» Shortest Paths in Distance-regular Graphs
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 3 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 2 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ICALT
2006
IEEE
14 years 1 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan