I/O-efficient algorithms for graphs of bounded treewidth (Q834592)

From MaRDI portal
scientific article
Language Label Description Also known as
English
I/O-efficient algorithms for graphs of bounded treewidth
scientific article

    Statements

    I/O-efficient algorithms for graphs of bounded treewidth (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    external memory algorithms
    0 references
    bounded treewidth
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references