Color-coding, J. ACM, vol.42, issue.4, pp.844-856, 1995. ,
Foundations of modern query languages for graph databases, ACM Comput. Surv, vol.50, issue.5, p.40, 2017. ,
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard, pp.629-638, 2012. ,
Modularity of cycles and paths in graphs, J. ACM, vol.38, issue.2, pp.255-274, 1991. ,
A trichotomy for regular simple path queries on graphs, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp.261-272, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00806448
Formal-language-constrained path problems, SIAM J. Comput, vol.30, issue.3, pp.809-837, 2000. ,
Practical linked data access via SPARQL: the case of Wikidata, Proceedings of LDOW Workshop, 2018. ,
An analytical study of large SPARQL query logs, J, vol.11, issue.2, pp.149-161, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01979692
Navigating the maze of Wikidata query logs, The World Wide Web Conference, pp.127-138, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02096714
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Nondeterministic space is closed under complementation, SIAM J. Comput, vol.17, issue.5, pp.935-938, 1988. ,
, Descriptive Complexity, 1999.
Computing label-constraint reachability in graph databases, SIGMOD Conference, pp.123-134, 2010. ,
Directed tree-width, J. Comb. Theory, Ser. B, vol.82, issue.1, pp.138-154, 2001. ,
Regular path queries on large graphs, pp.177-194, 2012. ,
The even-path problem for graphs and digraphs, Networks, vol.14, issue.4, pp.507-513, 1984. ,
A query language for biological networks, p.39, 2005. ,
The complexity of regular expressions and property paths in SPARQL, ACM Trans. Database Syst. (TODS), vol.38, issue.4, p.24, 2013. ,
Evaluation and enumeration problems for regular path queries, ICDT, in: LIPIcs, vol.98, p.21, 2018. ,
Finding regular simple paths in graph databases, SIAM J. Comput, vol.24, issue.6, pp.1235-1258, 1995. ,
Finding an even simple path in a directed planar graph, SIAM J. Comput, vol.29, pp.685-695, 1999. ,
A polynomial-time algorithm for finding regular simple paths in outerplanar graphs, J. Algorithms, vol.35, issue.2, pp.235-259, 2000. ,
Graph data management for molecular biology, Omics. J. Integr. Biol, vol.7, issue.1, pp.75-78, 2003. ,
, Computational Complexity, 1994.
The theory of definite automata, IEEE Trans. Electron. Comput. EC, vol.12, issue.3, pp.233-243, 1963. ,
Graph minors XIII. The disjoint paths problem, J. Comb. Theory, Ser. B, vol.63, issue.1, pp.65-110, 1995. ,
Space-bounded hierarchies and probabilistic computations, J. Comput. Syst. Sci, vol.28, issue.2, pp.216-230, 1984. ,
Finding k disjoint paths in a directed planar graph, SIAM J. Comput, vol.23, issue.4, pp.780-788, 1994. ,
On finite monoids having only trivial subgroups, Inf. Control, vol.8, issue.2, pp.190-194, 1965. ,
Complexity results on labeled shortest path problems from wireless routing metrics, Comput. Netw, vol.54, issue.2, pp.208-217, 2010. ,