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 11 items.
- Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Finding a maximum set of independent chords in a circle (Q1186584) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs (Q3333069) (← links)
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs (Q5689814) (← links)