Pages that link to "Item:Q1195927"
From MaRDI portal
The following pages link to The weighted maximum independent set problem in permutation graphs (Q1195927):
Displaying 18 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- Algorithms for solving a problem on the largest set of pairwise incomparable weighted vertices of a directed graph without circuits. (Q610000) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- Facets for node packing (Q1278997) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- Maximum weighted independent sets on transitive graphs and applications (Q4225377) (← links)
- MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS (Q4294716) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
- (Q5417623) (← links)
