Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring planar graphs in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximum independent sets in rectangle intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking fuzzy interval numbers in the setting of random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking fuzzy interval numbers in the setting of random sets -- further results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel time bounds for the maximum clique problem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets and systems. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking fuzzy numbers in the setting of possibility theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ARITHMETIC OPERATIONS OF INTERVAL NUMBERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring problems for relatives of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A still better performance guarantee for approximate graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to generate all maximal independent sets on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm to generate all maximal independent sets on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel 3-coloring algorithm for rooted trees and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight<i>k</i>-independent set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient PRAM algorithm for maximum-weight independent set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On comparing interval numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Revision as of 18:35, 25 June 2024

scientific article
Language Label Description Also known as
English
Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
scientific article

    Statements

    Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2007
    0 references
    modelling
    0 references
    colouring
    0 references
    interval numbers
    0 references
    interval graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references