A new neural network algorithm for planarization problems (Q2250738): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043700 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5698249 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A hybrid descent method for global optimization / rank | |||
Normal rank | |||
Latest revision as of 18:20, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new neural network algorithm for planarization problems |
scientific article |
Statements
A new neural network algorithm for planarization problems (English)
0 references
21 July 2014
0 references
graph planarization problem
0 references
planar embedding algorithm
0 references
Hopfield network
0 references
energy function
0 references
simulated annealing
0 references
