A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simulated annealing algorithm for the maximum planar subgraph problem |
scientific article; zbMATH DE number 2123965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
29 December 2004
0 references
simulated annealing
0 references
maximum planar subgraph
0 references
graph planarization
0 references
0 references
0 references
0.8434763550758362
0 references
0.8331583142280579
0 references
0.8308373689651489
0 references
0.82883620262146
0 references
