Cross-series-parallel digraphs
From MaRDI portal
Publication:1983112
DOI10.1016/j.dam.2020.12.012zbMath1477.05083OpenAlexW3118101106MaRDI QIDQ1983112
Rainer Schrader, Jorin Dornemann
Publication date: 15 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.012
Ordered sets (06A99) Directed graphs (digraphs), tournaments (05C20) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact counting of Euler tours for generalized series-parallel graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Some properties of line digraphs
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- On the computational complexity of the order polynomial
- N-free posets as generalizations of series-parallel posets
- Minimizing bumps in ordered sets by substitution decomposition
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Combinatorial algorithms on a class of graphs
- \(N\)-extendible posets, and how to minimize total weighted completion time
- The permutahedron of \(N\)-sparse posets
- Generalized max flow in series-parallel graphs
- Earliest arrival flows on series-parallel graphs
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring
- Searching in Trees, Series-Parallel and Interval Orders
- Searching in 2-dimensional partial orders
- The Jump Number of Dags and Posets: An Introduction
- The Recognition of Series Parallel Digraphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- The 3-Irreducible Partially Ordered Sets
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Linear-time computation of optimal subgraphs of decomposable graphs
- Isomorphism of Planar Graphs (Working Paper)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- Space efficient algorithms for directed series–parallel graphs
This page was built for publication: Cross-series-parallel digraphs
