A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236)

From MaRDI portal
Revision as of 01:57, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    4 April 2012
    0 references
    0 references
    crossing minimization
    0 references
    adjacency matrix
    0 references
    network flow
    0 references
    TSP
    0 references
    0 references
    0 references
    0 references