Pages that link to "Item:Q861467"
From MaRDI portal
The following pages link to Maximum weight independent set of circular-arc graph and its application (Q861467):
Displaying 5 items.
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662) (← links)
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292) (← links)