Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408)

From MaRDI portal
scientific article; zbMATH DE number 6734950
Language Label Description Also known as
English
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
scientific article; zbMATH DE number 6734950

    Statements

    Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (English)
    0 references
    0 references
    23 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms and data structures
    0 references
    graph algorithms
    0 references
    parameterized algorithms
    0 references
    Steiner tree problem
    0 references
    sparse graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references