Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
scientific article

    Statements

    Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar embedding
    0 references
    minimum depth
    0 references
    planar graph
    0 references
    triconnected components
    0 references
    0 references