The interval-merging problem
From MaRDI portal
Publication:867634
DOI10.1016/j.ins.2006.03.009zbMath1142.68332OpenAlexW1980267463MaRDI QIDQ867634
Publication date: 16 February 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.03.009
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- Jump number maximization for proper interval graphs and series-parallel graphs
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Scheduling with conflicts on bipartite and interval graphs
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
- Parallel Merge Sort
- Graph Classes: A Survey
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
- Approximating Bandwidth by Mixing Layouts of Interval Graphs
- Parallel computation on interval graphs: algorithms and experiments
- Finding Connected Components in O(log n log log n) Time on the EREW PRAM
- Tagged probe interval graphs
- Edge and total coloring of interval graphs
This page was built for publication: The interval-merging problem
