scientific article; zbMATH DE number 7297854

MaRDI QIDQ5144653zbMATH OpenFDO

Authors Miguel Romero, Pablo Barceló, Moshe Y. Vardi

Publication date 19 January 2021

Full work available at URL http://dl.acm.org/citation.cfm?id=3330041

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 4101217
• On recognizing graphs by numbers of homomorphisms
• scientific article; zbMATH DE number 861321
• scientific article; zbMATH DE number 1054727
• scientific article; zbMATH DE number 93767
• Graph homomorphisms
• scientific article; zbMATH DE number 4162940
• The Homomorphism Structure of Classes of Graphs

Cited in

(13)

• Complexity of conjunctive regular path query homomorphisms
• Querying regular graph patterns
• Evaluation and enumeration problems for regular path queries
• One hierarchy spawns another, graph deconstructions and the complexity classification of conjunctive queries
• One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries
• The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs
• Fine-Grained Complexity of Regular Path Queries
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
• A rule-based procedure for graph query solving
• Evaluating graph queries using semantic treewidth
• Semantic tree-width and path-width of conjunctive regular path queries
• Fine-grained complexity of regular path queries
• Fine-grained complexity of ontology mediated queries (invited paper)

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 Q5144653)