The Recognition of Series Parallel Digraphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An algorithm for minimizing setups in precedence constrained scheduling
- Complexity of finding a join of maximum weight
- Reduction algorithms for graphs of small treewidth
- A note on the recognition of nested graphs
- Network characterizations for excluding Braess's paradox
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Chronological rectangle digraphs which are two-terminal series-parallel
- Recoverable robust shortest path problem under interval budgeted uncertainty representations
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- Automata-based Representations for Infinite Graphs
- Single machine scheduling with a generalized job-dependent cumulative effect
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Lattices of crosscuts
- Miscellaneous digraph classes
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Typical sequences revisited -- computing width parameters of graphs
- Functions computed by monotone Boolean formulas with no repeated variables
- The two-machine flow shop problem with arbitrary precedence relations
- Treelength of series-parallel graphs
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Drawing series parallel digraphs symmetrically
- An optimal algorithm for an outerplanar facility location problem with improved time complexity
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
- A branch and bound algorithm for the minimum storage-time sequencing problem
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
- The obstructions of a minor-closed set of graphs defined by a context-free grammar
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Retractions onto series-parallel posets
- Equational Theories of Scattered and Countable Series-Parallel Posets
- The price of anarchy in series-parallel network congestion games
- A compact labelling scheme for series-parallel graphs
- Linear time algorithms on mirror trees
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- Nonfinite axiomatizability of the equational theory of shuffle
- Parallel interval order recognition and construction of interval representations
- Sex-equal stable matchings: complexity and exact algorithms
- Sequencing with general precedence constraints
- Free shuffle algebras in language varieties
- Efficiently parallelizable problems on a class of decomposable graphs
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- On the calculation of transitive reduction-closure of orders
- Improving selfish routing for risk-averse players
- Treemaps for Directed Acyclic Graphs
- Solutions for subset sum problems with special digraph constraints
- Minimum cost dynamic flows: the series-parallel case
- On point-sets that support planar graphs
- Robust transshipment problem under consistent flow constraints
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- On the complexity of partitioning graphs into connected subgraphs
- Activity nets: A guided tour through some recent developments
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- Improving selfish routing for risk-averse players
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Improving spanning trees by upgrading nodes
- Transitive closure for restricted classes of partial orders
- On Maltsev digraphs
- On the approximability of minmax (regret) network optimization problems
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- On the flow cost lowering problem
- Antichain cutsets
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Capacity-preserving subgraphs of directed flow networks
- Measuring the distance to series-parallelity by path expressions
- Solving the weighted k-separator problem in graphs with specific modules
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- Aggregation approach for the minimum binary cost tension problem
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- The equational theory of pomsets
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Scheduling modular projects on a bottleneck resource
- On finding the jump number of a partial order by substitution decomposition
- Node-max-cut and the complexity of equilibrium in linear weighted congestion games
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
- On finding a minimum vertex cover of a series-parallel graph
- The discrete time-cost tradeoff problem revisited
- Profile Scheduling of Opposing Forests and Level Orders
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- Series-parallel languages and the bounded-width property
- Theory and methodology of time-dependent scheduling: past, present and future
- Monadic second-order evaluations on tree-decomposable graphs
- Pomsets with boxes: protection, separation, and locality in concurrent Kleene algebra
- The complexity of the timetable‐based railway network design problem
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- A k-structure generalization of the theory of 2-structures
- The knapsack problem with special neighbor constraints
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
- Earliest arrival flows on series-parallel graphs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A polynomial algorithm for minDSC on a subclass of series Parallel graphs
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- Languages under concatenation and shuffling
- The connected critical node problem
- Robust minimum cost flow problem under consistent flow constraints
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
This page was built for publication: The Recognition of Series Parallel Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936212)
