Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496)

From MaRDI portal
Revision as of 19:23, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the maximum internal spanning tree problem on interval graphs in polynomial time
scientific article

    Statements

    Solving the maximum internal spanning tree problem on interval graphs in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2018
    0 references
    polynomial
    0 references
    algorithm
    0 references
    maximum internal spanning tree
    0 references
    interval graph
    0 references

    Identifiers

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