Pages that link to "Item:Q3936212"
From MaRDI portal
The following pages link to The Recognition of Series Parallel Digraphs (Q3936212):
Displaying 50 items.
- Functions computed by monotone Boolean formulas with no repeated variables (Q1121854) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Sequencing with general precedence constraints (Q1142151) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
- Series parallel posets with nonfinitely generated clones (Q1319080) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Combinatorial algorithms on a class of graphs (Q1336626) (← links)
- The three-machine flow-shop problem with arbitrary precedence relations (Q1342006) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- Axiomatizing shuffle and concatenation in languages (Q1383153) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- On the flow cost lowering problem (Q1600835) (← links)
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- A comparison of point-based approaches to qualitative temporal reasoning (Q1606329) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Two equational theories of partial words (Q1643141) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- Budgeted colored matching problems (Q1742233) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Series-parallel posets and the Tutte polynomial (Q1815311) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Drawing series parallel digraphs symmetrically (Q1841117) (← links)
- Predicting nearly as well as the best pruning of a planar decision graph. (Q1853514) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Rationality in algebras with a series operation (Q1854484) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
- Linkless symmetric drawings of series parallel digraphs (Q1886237) (← links)
- A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
- A new approach to solving three combinatorial enumeration problems on planar graphs (Q1894355) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
