A tabu search algorithm for the bipartite drawing problem (Q1609918)

From MaRDI portal
Revision as of 13:59, 4 June 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 tabu search algorithm for the bipartite drawing problem
scientific article

    Statements

    title
    A tabu search algorithm for the bipartite drawing problem (English)
    0 references
    author
    Rafael Martí
    0 references
    publication date
    18 August 2002
    0 references
    zbMATH Keywords
    graph drawing problem
    0 references
    arc crossing minimization
    0 references
    tabu search
    0 references

    Identifiers

    zbMATH DE Number
    1782825
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1609918&oldid=34311886"
    Powered by MediaWiki