A bisection algorithm for grammar-based compression of ordered trees (Q407558)

From MaRDI portal
Revision as of 01:17, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bisection algorithm for grammar-based compression of ordered trees
scientific article

    Statements

    title
    A bisection algorithm for grammar-based compression of ordered trees (English)
    0 references
    author
    Tatsuya Akutsu
    0 references
    publication date
    27 March 2012
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    graph algorithms
    0 references
    tree grammars
    0 references
    data compression
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P30
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    6018482
    0 references
    OpenAlex ID
    W2019758562
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q407558&oldid=35270804"
    Powered by MediaWiki