An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Ju-Yuan Hsiao / rank
 
Normal rank
Property / author
 
Property / author: Ruay-Shiung Chang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the single step graph searching problem by solving the maximum two-independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Maximum Two-Chain Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Latest revision as of 12:53, 17 May 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
scientific article

    Statements

    An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum weight \(k\)-independent set problem
    0 references
    algorithm
    0 references
    maximum weight independent set problem
    0 references
    maximum weight 2-independent set problem
    0 references
    interval graph
    0 references