The interval-merging problem (Q867634): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge and total coloring of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump number maximization for proper interval graphs and series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Connected Components in O(log n log log n) Time on the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation on interval graphs: algorithms and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts on bipartite and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Bandwidth by Mixing Layouts of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring and interval graphs: A tight upper bound for the minimum number of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel algorithm to construct a tree 3-spanner on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tagged probe interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures / rank
 
Normal rank

Latest revision as of 14:51, 25 June 2024

scientific article
Language Label Description Also known as
English
The interval-merging problem
scientific article

    Statements

    The interval-merging problem (English)
    0 references
    0 references
    16 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    design and analysis of algorithms
    0 references
    parallel algorithms
    0 references
    data structures
    0 references
    interval-merging
    0 references
    PRAM
    0 references
    0 references