A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415)

From MaRDI portal
Revision as of 16:55, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2123965
Language Label Description Also known as
English
A simulated annealing algorithm for the maximum planar subgraph problem
scientific article; zbMATH DE number 2123965

    Statements

    A simulated annealing algorithm for the maximum planar subgraph problem (English)
    0 references
    0 references
    29 December 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simulated annealing
    0 references
    maximum planar subgraph
    0 references
    graph planarization
    0 references
    0 references