Pages that link to "Item:Q5931033"
From MaRDI portal
The following pages link to An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs (Q5931033):
Displaying 9 items.
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- Independent sets in graphs (Q501998) (← 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)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
