Planar stage graphs: Characterizations and applications

DOI10.1016/S0304-3975(96)00201-0zbMath0903.68140OpenAlexW2072607204MaRDI QIDQ1392202

Jörg-Rüdiger Sack, Danny Krizanc, Evangelos Kranakis, Frank Bauernöppel, Anil Maheshwari

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00201-0

zbMATH Keywords

planar stage graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing ⋮ Ray shooting from convex ranges

Cites Work

• A linear-time algorithm for a special case of disjoint set union
• Optimal scheduling for two-processor systems
• On Comparability and Permutation Graphs
• Parallel Merge Sort
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• Scheduling Graphs on Two Processors
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Optimal Sequencing of Two Equivalent Processors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planar stage graphs: Characterizations and applications