Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
From MaRDI portal
Publication:881882
DOI10.1016/j.ins.2007.01.015zbMath1115.05087OpenAlexW2032232293MaRDI QIDQ881882
Madhumangal Pal, Anita Saha, Tapan Kumar Pal
Publication date: 18 May 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.01.015
Applications of graph theory (05C90) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
A linear time algorithm to compute square of interval graphs and their colouring ⋮ Robust maximum weighted independent-set problems on interval graphs ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Solution of interval PERT/CPM network problems by a simplified tabular method ⋮ Aliased register allocation for straight-line programs is NP-complete ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ Complexity of the robust weighted independent set problems on interval graphs ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ Energy of interval-valued fuzzy graphs and its application in ecological systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
- An optimal greedy heuristic to color interval graphs
- A note on maximum independent sets in rectangle intersection graphs
- Covering and coloring problems for relatives of intervals
- Ranking fuzzy numbers in the setting of possibility theory
- The maximum k-colorable subgraph problem for chordal graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Fuzzy sets and systems. Theory and applications
- Optimal parallel 3-coloring algorithm for rooted trees and its applications
- Optimal parallel time bounds for the maximum clique problem on intervals
- A still better performance guarantee for approximate graph coloring
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- On comparing interval numbers
- Ranking fuzzy interval numbers in the setting of random sets
- Ranking fuzzy interval numbers in the setting of random sets -- further results
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Coloring planar graphs in parallel
- Fast Parallel Algorithms for Chordal Graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Randomized online graph coloring
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- Independent Sets in Asteroidal Triple-Free Graphs
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- Maximum weightk-independent set problem on permutation graphs
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
- ON ARITHMETIC OPERATIONS OF INTERVAL NUMBERS
- An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
This page was built for publication: Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
