Parallel computation on interval graphs: algorithms and experiments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 924427 (Why is no real title available?)
- An Optimal Solution for the Channel-Assignment Problem
- Parallel Scheduling Algorithms
- Some parallel algorithms on interval graphs
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Cited in
(6)- scientific article; zbMATH DE number 123468 (Why is no real title available?)
- scientific article; zbMATH DE number 3892606 (Why is no real title available?)
- The interval-merging problem
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- Designing efficient parallel algorithms on interval graphs
This page was built for publication: Parallel computation on interval graphs: algorithms and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4790934)