An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762)

From MaRDI portal
Revision as of 11:05, 24 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i>
scientific article

    Statements

    An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (English)
    0 references
    0 references
    1975
    0 references

    Identifiers

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