Pages that link to "Item:Q3936212"
From MaRDI portal
The following pages link to The Recognition of Series Parallel Digraphs (Q3936212):
Displayed 50 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- Scheduling modular projects on a bottleneck resource (Q398901) (← links)
- Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Web services composition: complexity and models (Q499345) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Series-parallel languages on scattered and countable posets (Q533879) (← links)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Series parallel linkages (Q555265) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- On finding a minimum vertex cover of a series-parallel graph (Q758196) (← links)
- Antichain cutsets (Q762182) (← links)
- A new characterization of \(\mathcal{V} \)-posets (Q781541) (← links)
- Lattices of crosscuts (Q801942) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- Estimation of flows in flow networks (Q852931) (← links)
- Asymptotic enumeration of N-free partial orders (Q913831) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm (Q967432) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- Aggregation approach for the minimum binary cost tension problem (Q1015014) (← links)
- On the two-dimensional orthogonal drawing of series-parallel graphs (Q1026151) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- Constructing maximal slicings from geometry (Q1088412) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Adamant digraphs (Q1104933) (← links)
- The equational theory of pomsets (Q1119012) (← links)