Pages that link to "Item:Q4537611"
From MaRDI portal
The following pages link to A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611):
Displaying 3 items.
- Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
