1172 search results - page 9 / 235 » Path Algorithms on Regular Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
SAMOS
2004
Springer
14 years 1 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
PODS
2010
ACM
14 years 22 days ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...