The Recognition of Series Parallel Digraphs
From MaRDI portal
Publication:3936212
Cited in
(only showing first 100 items - show all)- Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
- Optimal scheduling on parallel machines for a new order class
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- How fast can we reach a target vertex in stochastic temporal graphs?
- Complexity and approximability of the maximum flow problem with minimum quantities
- Fully dynamic recognition algorithm and certificate for directed cographs
- Predicting nearly as well as the best pruning of a planar decision graph.
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Can transitive orientation make sandwich problems easier?
- Constructing maximal slicings from geometry
- Greedy concepts for network flow problems
- A Cryptographic Code Based on Digraphs
- On scheduling series-parallel DAGs to maximize area
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Jump number maximization for proper interval graphs and series-parallel graphs
- Series-parallel languages on scattered and countable posets
- Optimal Linear Extensions by Interchanging Chains
- On graphs with no induced subdivision of \(K_4\)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- On-line algorithms for orders
- Parallel \(N\)-free order recognition
- Acyclic coloring parameterized by directed clique-width
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- New complexity results and algorithms for the minimum tollbooth problem
- Criticality analysis of activity networks under interval uncertainty
- Learning pomset automata
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
- Drawing graphs with attribute graph grammars
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Monotonicity of equilibria in nonatomic congestion games
- Series parallel posets with nonfinitely generated clones
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Concurrency and atomicity
- Algebraic and graph-theoretic properties of infiniten-posets
- Adamant digraphs
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Acyclically 3-colorable planar graphs
- All subgraphs of a wheel are 5-coupled-choosable
- Axiomatizing shuffle and concatenation in languages
- Cayley posets
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
- System Reliability Analysis in the Presence of Dependent Component Failures
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Scheduling on Two Unbounded Resources with Communication Costs
- Reversible Kleene lattices
- Budget-constrained minimum cost flows
- Scheduling linearly shortening jobs under precedence constraints
- Series parallel linkages
- Optimization problems with color-induced budget constraints
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Budgeted colored matching problems
- Series-parallel posets and the Tutte polynomial
- Exact counting of Euler tours for generalized series-parallel graphs
- A note on integral generalized flows in directed partial 2-trees
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Estimation of flows in flow networks
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Describing the local structure of sequence graphs
- Combinatorial algorithms on a class of graphs
- Linkless symmetric drawings of series parallel digraphs
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Posets with maximal Möbius function
- Two-stage combinatorial optimization problems under risk
- Cross-series-parallel digraphs
- Modular decomposition and transitive orientation
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- A recurrence template for several parameters in series-parallel graphs
- Entropic uniform sampling of linear extensions in series-parallel posets
- A tight lower bound for primitivity in k-structures
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Convex generalized flows
- Maximum flows in generalized processing networks
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- Rationality in algebras with a series operation
- Riordan posets and associated incidence matrices
- On characterizations for subclasses of directed co-graphs
- Parallel recognition of series-parallel graphs
- How to draw a series-parallel digraph
- Lattice-based sum of t-norms on bounded lattices
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- A comparison of point-based approaches to qualitative temporal reasoning
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- The weighted \(k\)-path vertex cover problem on series-parallel graphs
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Minimum cost flow algorithms for series-parallel networks
- Two equational theories of partial words
- Minimum cost flows with minimum quantities
- Quadratic assignment problems on series-parallel digraphs
- Oriented vertex and arc coloring of edge series-parallel digraphs
- Graph orientation to maximize the minimum weighted outdegree
- The knapsack problem with special neighbor constraints on directed co-graphs
- 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
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)
