On the computational difficulty of the terminal connection problem (Q6041044)

From MaRDI portal
scientific article; zbMATH DE number 7689050
Language Label Description Also known as
English
On the computational difficulty of the terminal connection problem
scientific article; zbMATH DE number 7689050

    Statements

    On the computational difficulty of the terminal connection problem (English)
    0 references
    0 references
    25 May 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational difficulty of problems
    0 references
    parameterized complexity
    0 references
    terminal vertices
    0 references
    connection tree
    0 references
    Steiner tree
    0 references
    split graphs
    0 references
    strongly chordal graphs
    0 references
    cographs
    0 references
    bounded degree
    0 references
    0 references
    0 references
    0 references