On the obfuscation complexity of planar graphs (Q924163)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the obfuscation complexity of planar graphs
scientific article

    Statements

    On the obfuscation complexity of planar graphs (English)
    0 references
    0 references
    28 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial games
    0 references
    planar graphs
    0 references
    straight line drawings
    0 references
    computational complexity
    0 references
    0 references