Pages that link to "Item:Q881882"
From MaRDI portal
The following pages link to Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882):
Displaying 5 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
