An approximation algorithm for maximum internal spanning tree (Q1743498)

From MaRDI portal
Revision as of 17:05, 26 July 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 approximation algorithm for maximum internal spanning tree
scientific article

    Statements

    An approximation algorithm for maximum internal spanning tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2018
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    spanning trees
    0 references
    path-cycle covers
    0 references

    Identifiers