Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398)

From MaRDI portal
Revision as of 22:22, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126568023, #quickstatements; #temporary_batch_1722802475495)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7765761
Language Label Description Also known as
English
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
scientific article; zbMATH DE number 7765761

    Statements

    title
    Parameterized complexity of finding a spanning tree with minimum reload cost diameter (English)
    0 references
    DOI
    10.1002/net.21923
    0 references
    author
    Julien Baste
    0 references
    Didem Gözüpek
    0 references
    Christophe Paul
    0 references
    Ignasi Sau
    0 references
    Mordechai Shalom
    0 references
    Dimitrios M. Thilikos
    0 references
    published in
    Networks
    0 references
    publication date
    15 November 2023
    0 references
    Mathematics Subject Classification ID
    68Q27
    0 references
    68Q17
    0 references
    68R10
    0 references
    90C35
    0 references
    zbMATH DE Number
    7765761
    0 references
    zbMATH Keywords
    dynamic programming
    0 references
    FPT algorithm
    0 references
    minimum-diameter spanning tree
    0 references
    parameterized complexity
    0 references
    reload-cost problems
    0 references
    treewidth
    0 references
    Wikidata QID
    Q126568023
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6087398&oldid=37581282"
    Powered by MediaWiki