Finding Regular Simple Paths in Graph Databases
- 1 December 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (6), 1235-1258
- https://doi.org/10.1137/s009753979122370x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphsInformation Processing Letters, 1986
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- The even‐path problem for graphs and digraphsNetworks, 1984
- Fast Algorithms for Solving Path ProblemsJournal of the ACM, 1981
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- On the completeness of query languages for relational data basesLecture Notes in Computer Science, 1978
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976