The following pages link to (Q5588563):
Displaying 3 items.
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
