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

From MaRDI portal
Revision as of 07:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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