Structural recursion for querying ordered graphs (Q5244813)

From MaRDI portal
Revision as of 22:18, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6421049
Language Label Description Also known as
English
Structural recursion for querying ordered graphs
scientific article; zbMATH DE number 6421049

    Statements

    title
    Structural recursion for querying ordered graphs (English)
    0 references
    author
    Soichiro Hidaka
    0 references
    Kazuyuki Asada
    0 references
    Zhenjiang Hu
    0 references
    Hiroyuki Kato
    0 references
    Keisuke Nakano
    0 references
    publication date
    30 March 2015
    0 references
    zbMATH Keywords
    bisimulation
    0 references
    graph query language
    0 references
    optimization
    0 references
    ordered graphs
    0 references
    structural recursion
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P05
    0 references
    68N18
    0 references
    68R10
    0 references
    zbMATH DE Number
    6421049
    0 references
    OpenAlex ID
    W2161061431
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5244813&oldid=32145888"
    Powered by MediaWiki