Heuristic and metaheuristic methods for computing graph treewidth (Q5479837)

From MaRDI portal
Revision as of 17:59, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5039977
Language Label Description Also known as
English
Heuristic and metaheuristic methods for computing graph treewidth
scientific article; zbMATH DE number 5039977

    Statements

    title
    Heuristic and metaheuristic methods for computing graph treewidth (English)
    0 references
    DOI
    10.1051/ro:2004011
    0 references
    author
    François Clautiaux
    0 references
    Aziz Moukrim
    0 references
    Stéphane Negre
    0 references
    Jacques Carlier
    0 references
    publication date
    11 July 2006
    0 references
    Mathematics Subject Classification ID
    90C59
    0 references
    68R10
    0 references
    68W05
    0 references
    68Q25
    0 references
    90C35
    0 references
    05C05
    0 references
    zbMATH DE Number
    5039977
    0 references
    zbMATH Keywords
    treewidth
    0 references
    elimination orderings
    0 references
    triangulated graphs
    0 references
    heuristic
    0 references
    metaheuristic
    0 references
    computational experiments
    0 references
    OpenAlex ID
    W2125547222
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5479837&oldid=34883055"
    Powered by MediaWiki