Pages that link to "Item:Q1195486"
From MaRDI portal
The following pages link to Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486):
Displaying 15 items.
- Pattern matching for permutations (Q293263) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation (Q1930607) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- On the longest upsequence problem for permutations (Q2731076) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← 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)
- Pattern matching for permutations (Q5060113) (← links)
