2294 search results - page 3 / 459 » From Path Graphs to Directed Path Graphs |
MICS
2008
14 years 11 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
SCN
2008
Springer
14 years 11 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
125
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...