On the two-connected planar spanning subgraph polytope (Q1382280)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the two-connected planar spanning subgraph polytope
scientific article

    Statements

    On the two-connected planar spanning subgraph polytope (English)
    0 references
    0 references
    0 references
    25 March 1998
    0 references
    The authors investigate the problem of finding a two-connected spanning planar subgraph of maximum weight in a complete edge-weighted graph, from a polyhedral point of view. The problem is important in automatic graph drawing.
    0 references
    0 references
    spanning planar subgraph
    0 references
    graph drawing
    0 references
    0 references