The Recognition of Series Parallel Digraphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- Aggregation approach for the minimum binary cost tension problem
- On the two-dimensional orthogonal drawing of series-parallel graphs
- On the complexity of partitioning graphs into connected subgraphs
- Minimum cost flow algorithms for series-parallel networks
- An algorithm for minimizing setups in precedence constrained scheduling
- A compact labelling scheme for series-parallel graphs
- Constructing maximal slicings from geometry
- Greedy concepts for network flow problems
- On finding the jump number of a partial order by substitution decomposition
- Adamant digraphs
- The equational theory of pomsets
- Functions computed by monotone Boolean formulas with no repeated variables
- Concurrency and atomicity
- The discrete time-cost tradeoff problem revisited
- Sequencing with general precedence constraints
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Transitive closure for restricted classes of partial orders
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs
- Parallel recognition of series-parallel graphs
- Modular decomposition and transitive orientation
- Optimal scheduling on parallel machines for a new order class
- Series parallel posets with nonfinitely generated clones
- A k-structure generalization of the theory of 2-structures
- A recurrence template for several parameters in series-parallel graphs
- Combinatorial algorithms on a class of graphs
- The three-machine flow-shop problem with arbitrary precedence relations
- Dynamic expression trees
- Scheduling UET-UCT series-parallel graphs on two processors
- The obstructions of a minor-closed set of graphs defined by a context-free grammar
- Axiomatizing shuffle and concatenation in languages
- Lower bounds for the quadratic semi-assignment problem
- Activity nets: A guided tour through some recent developments
- On-line algorithms for orders
- Parallel \(N\)-free order recognition
- Series-parallel languages and the bounded-width property
- On the flow cost lowering problem
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- A comparison of point-based approaches to qualitative temporal reasoning
- Perfect edge domination and efficient edge domination in graphs
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Two equational theories of partial words
- Scheduling series-parallel task graphs to minimize peak memory
- Single machine scheduling with a generalized job-dependent cumulative effect
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Budgeted colored matching problems
- Efficiently parallelizable problems on a class of decomposable graphs
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Series-parallel posets and the Tutte polynomial
- Jump number maximization for proper interval graphs and series-parallel graphs
- Drawing series parallel digraphs symmetrically
- Predicting nearly as well as the best pruning of a planar decision graph.
- Reduction algorithms for graphs of small treewidth
- Rationality in algebras with a series operation
- The quadratic 0-1 knapsack problem with series-parallel support
- Computational aspects of the 2-dimension of partially ordered sets
- Linkless symmetric drawings of series parallel digraphs
- A linear algorithm to decompose inheritance graphs into modules
- A new approach to solving three combinatorial enumeration problems on planar graphs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
- Minimum cost flows with minimum quantities
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Improving spanning trees by upgrading nodes
- Cross-series-parallel digraphs
- Maximum flows in generalized processing networks
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- On characterizations for subclasses of directed co-graphs
- Lattice-based sum of t-norms on bounded lattices
- Linear time algorithms on mirror trees
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- All subgraphs of a wheel are 5-coupled-choosable
- The knapsack problem with special neighbor constraints
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- How fast can we reach a target vertex in stochastic temporal graphs?
- Cayley posets
- Solutions for subset sum problems with special digraph constraints
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Learning pomset automata
- A note on integral generalized flows in directed partial 2-trees
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Riordan posets and associated incidence matrices
- On Maltsev digraphs
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Posets with maximal Möbius function
- Two-stage combinatorial optimization problems under risk
- Improving selfish routing for risk-averse players
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Convex generalized flows
- Describing the local structure of sequence graphs
- Resource allocation via dynamic programming in activity networks
- The two-machine flow shop problem with arbitrary precedence relations
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Can transitive orientation make sandwich problems easier?
- Entropic uniform sampling of linear extensions in series-parallel posets
- Chronological rectangle digraphs which are two-terminal series-parallel
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)
