A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207160410001684352 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003965618 / rank | |||
Normal rank | |||
Revision as of 00:06, 20 March 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
29 December 2004
0 references
simulated annealing
0 references
maximum planar subgraph
0 references
graph planarization
0 references
