Database Paper Browser

Back to papers

Finding Regular Simple Paths in Graph Databases

Summary: Find node pairs connected by a simple path in a labeled digraph with path labels in L(R). General problem intractable; polynomial-time for conflict-free G/R; defines a syntactically characterized language class solvable in poly-time data+expression. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7898
Venue
VLDB
Year
1989
Pagerank
0.00011946075
Overall Rank
1,444 | 89.96%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers