scientific article; zbMATH DE number 7650987

DOI10.4230/LIPICS.ICDT.2020.9MaRDI QIDQ5874362zbMATH OpenFDO

Authors Diego Figueira

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2020.9

zbMATH Keywords

2RPQbridge-width (bridgewidth)C2RPQcontainmentCRPQdichotomyequivalencegraph databasesgraph measureinclusionmax-cutminimal cut-setminimal edge separatorregular path queries (RPQ)tree-width (treewidth)UC2RPQ

Mathematics Subject Classification ID

Database theory (68P15)

Cited in

(5)

• Formal languages in information extraction and graph databases
• Fine-Grained Complexity of Regular Path Queries
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
• Semantic tree-width and path-width of conjunctive regular path queries
• Fine-grained complexity of regular path queries

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874362)