Steiner trees, connected domination and strongly chordal graphs (Q3701460)

From MaRDI portal
Revision as of 19:37, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Steiner trees, connected domination and strongly chordal graphs
scientific article

    Statements

    Steiner trees, connected domination and strongly chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree problems
    0 references
    connected dominating set problems
    0 references
    polynomial algorithm
    0 references
    chordal graphs
    0 references
    series-parallel graphs
    0 references
    NP-completeness results
    0 references
    0 references