Computing shortest heterochromatic monotone routes (Q2517794)

From MaRDI portal
Revision as of 19:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Computing shortest heterochromatic monotone routes
scientific article

    Statements

    title
    Computing shortest heterochromatic monotone routes (English)
    0 references
    author
    Gregorio Hernández
    0 references
    A. Ramírez-Vigueras
    0 references
    Jorge Urrutia
    0 references
    Inmaculada Ventura
    0 references
    Deborah Oliveros
    0 references
    J. Antoni Sellarès
    0 references
    publication date
    9 January 2009
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90B10
    0 references
    90B06
    0 references
    zbMATH DE Number
    5488547
    0 references
    zbMATH Keywords
    routing
    0 references
    heterochromatic monotone route
    0 references
    shortest path
    0 references
    computational geometry
    0 references
    OpenAlex ID
    W2026171456
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2517794&oldid=31373917"
    Powered by MediaWiki