A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758)

From MaRDI portal
Revision as of 15:44, 3 June 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
A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs
scientific article

    Statements

    A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (English)
    0 references
    0 references
    0 references
    19 December 2002
    0 references
    interval graph
    0 references
    independent set
    0 references
    network flow problem
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references
    analysis of algorithms
    0 references

    Identifiers