The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-013-9346-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034956447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative expressive power of navigational querying on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the calculus of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040000 / rank
 
Normal rank

Latest revision as of 16:38, 9 July 2024

scientific article
Language Label Description Also known as
English
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
scientific article

    Statements

    The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2015
    0 references
    Boolean query
    0 references
    transitive closure
    0 references
    relation algebra
    0 references
    unlabeled graph
    0 references
    expressiveness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references