Steiner trees, connected domination and strongly chordal graphs (Q3701460): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.3230150109 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153250924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank

Latest revision as of 18:37, 14 June 2024

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references