Parameterized Complexity of Geodetic Set (Q6089667)

From MaRDI portal
Revision as of 13:59, 3 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7764111
Language Label Description Also known as
English
Parameterized Complexity of Geodetic Set
scientific article; zbMATH DE number 7764111

    Statements

    author
    Leon Kellerhals
    0 references
    Tomohiro Koana
    0 references
    publication date
    13 November 2023
    0 references
    zbMATH Keywords
    NP-hard graph problems
    0 references
    shortest paths
    0 references
    tree-likeness
    0 references
    parameter hierarchy
    0 references
    data reduction
    0 references
    integer linear programming
    0 references
    title
    Parameterized Complexity of Geodetic Set (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q27
    0 references
    68Wxx
    0 references
    zbMATH DE Number
    7764111
    0 references
    OpenAlex ID
    W3116288092
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6089667&oldid=37576481"
    Powered by MediaWiki