Planar stage graphs: Characterizations and applications
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for a special case of disjoint set union
- A simple optimal parallel algorithm for reporting paths in a tree
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
- On Comparability and Permutation Graphs
- Optimal scheduling for two-processor systems
- Optimal Sequencing of Two Equivalent Processors
- Parallel Merge Sort
- Scheduling Graphs on Two Processors
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(4)
This page was built for publication: Planar stage graphs: Characterizations and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392202)