A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236): 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.1007/s10878-010-9326-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094686363 / rank | |||
Normal rank | |||
Revision as of 19:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rearrangement of adjacency matrix based approach for solving the crossing minimization problem |
scientific article |
Statements
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (English)
0 references
4 April 2012
0 references
crossing minimization
0 references
adjacency matrix
0 references
network flow
0 references
TSP
0 references
