1172 search results - page 1 / 235 » Path Algorithms on Regular Graphs |
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
EDBTW
2006
Springer
13 years 9 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...