Sciweavers

1172 search results - page 7 / 235
» Path Algorithms on Regular Graphs
Sort
View
IPL
2007
130views more  IPL 2007»
13 years 7 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
CC
2005
Springer
195views System Software» more  CC 2005»
13 years 9 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
Luca Padovani
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
14 years 1 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 6 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille