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 12 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)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
- Energy of interval-valued fuzzy graphs and its application in ecological systems (Q2089266) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs (Q6608601) (← links)
