Parallel \(N\)-free order recognition
From MaRDI portal
Publication:1392213
DOI10.1016/S0304-3975(96)00210-1zbMath0903.68096MaRDI QIDQ1392213
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel interval order recognition and construction of interval representations
- Some properties of line digraphs
- N-free posets as generalizations of series-parallel posets
- A linear-time recognition algorithm for interval dags
- A labeling algorithm to recognize a line digraph and output its root graph
- Transitive closure for restricted classes of partial orders
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- Optimal Linear Extensions by Interchanging Chains
- On Comparability and Permutation Graphs
- Algorithmic Approaches to Setup Minimization
- The minimum dummy task problem
- Parallel Merge Sort
- Scheduling Interval-Ordered Tasks
- The Recognition of Series Parallel Digraphs
- Ordres "C.A.C."
- On the Number of Stable States in a NOR Network
- Maximal chains and antichains
- Transitive Orientation of Graphs and Identification of Permutation Graphs
This page was built for publication: Parallel \(N\)-free order recognition
