Pages that link to "Item:Q924162"
From MaRDI portal
The following pages link to On the clique partitioning problem in weighted interval graphs (Q924162):
Displaying 8 items.
- A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- Two-way and multiway partitioning of a set of intervals for clique-width maximization (Q1283929) (← links)
- On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- (Q6068263) (← links)
- A polynomial time algorithm for the triangle packing problem on interval graphs (Q6140241) (← links)