A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829)

From MaRDI portal
Revision as of 01:40, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A greedy algorithm for finding maximum spanning trees in infinite graphs
scientific article

    Statements

    A greedy algorithm for finding maximum spanning trees in infinite graphs (English)
    0 references
    0 references
    12 December 2022
    0 references
    spanning trees
    0 references
    infinite graphs
    0 references
    infinite-dimensional optimization
    0 references

    Identifiers