A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:18, 8 February 2024

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