The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs

DOI10.1007/978-3-642-28472-4_8zbMath1319.68069OpenAlexW2155066775MaRDI QIDQ2902490

Stijn Vansummeren, George H. L. Fletcher, Yuqing Wu, Dirk Leinders, Jan Van den Bussche, Marc Gyssens, Dirk Van Gucht

Publication date: 20 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28472-4_8

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the index of convergence of a class of Boolean matrices with structural properties ⋮ The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs

This page was built for publication: The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs