A trichotomy for regular simple path queries on graphs (Q2009646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2019.08.006 / rank
Normal rank
 
Property / author
 
Property / author: Benoît Groz / rank
Normal rank
 
Property / author
 
Property / author: Benoît Groz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4390689069 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.6857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of cycles and paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal-Language-Constrained Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of regular expressions and property paths in SPARQL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and Enumeration Problems for Regular Path Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Regular Simple Paths in Graph Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an Even Simple Path in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Definite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded hierarchies and probabilistic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on labeled shortest path problems from wireless routing metrics / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127214244 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2019.08.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:27, 16 December 2024

scientific article
Language Label Description Also known as
English
A trichotomy for regular simple path queries on graphs
scientific article

    Statements

    A trichotomy for regular simple path queries on graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2019
    0 references
    graphs
    0 references
    regular simple paths
    0 references
    complexity
    0 references
    regular languages
    0 references
    automata
    0 references

    Identifiers

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