A polynomial algorithm for computing the weak rupture degree of trees (Q2279643)

From MaRDI portal
Revision as of 22:03, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127676326, #quickstatements; #temporary_batch_1722372779079)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for computing the weak rupture degree of trees
scientific article

    Statements

    A polynomial algorithm for computing the weak rupture degree of trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2019
    0 references
    graph
    0 references
    weak rupture degree
    0 references
    tree
    0 references
    algorithm
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references