Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668)

From MaRDI portal
Revision as of 01:25, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
scientific article

    Statements

    Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 March 2013
    0 references
    exact exponential-time algorithms
    0 references
    measure and conquer
    0 references
    parameterized algorithms
    0 references
    spanning tree problems
    0 references
    maximum internal spanning trees
    0 references

    Identifiers

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