Optimal stopping for many connected components in a graph (Q6074658)

From MaRDI portal
Revision as of 17:29, 26 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7749488
Language Label Description Also known as
English
Optimal stopping for many connected components in a graph
scientific article; zbMATH DE number 7749488

    Statements

    Optimal stopping for many connected components in a graph (English)
    0 references
    0 references
    12 October 2023
    0 references
    connected component
    0 references
    \(k\)-tree
    0 references
    optimal stopping
    0 references

    Identifiers

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