A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Panos M. Pardalos / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6021868 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
crossing minimization | |||
| Property / zbMATH Keywords: crossing minimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
adjacency matrix | |||
| Property / zbMATH Keywords: adjacency matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
network flow | |||
| Property / zbMATH Keywords: network flow / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
TSP | |||
| Property / zbMATH Keywords: TSP / rank | |||
Normal rank | |||
Revision as of 19:35, 29 June 2023
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
