Pages that link to "Item:Q3936212"

The following pages link to The Recognition of Series Parallel Digraphs (Q3936212):

Displaying 50 items.

• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
• Minimum cost flows with minimum quantities (Q1944944) (← links)
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
• Improving spanning trees by upgrading nodes (Q1960523) (← links)
• Cross-series-parallel digraphs (Q1983112) (← links)
• Maximum flows in generalized processing networks (Q2012883) (← links)
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
• On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
• Lattice-based sum of t-norms on bounded lattices (Q2042882) (← links)
• Linear time algorithms on mirror trees (Q2091108) (← links)
• A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
• All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
• The knapsack problem with special neighbor constraints (Q2123119) (← links)
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
• How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
• Cayley posets (Q2211714) (← links)
• Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
• Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
• Learning pomset automata (Q2233430) (← links)
• A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
• Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
• Riordan posets and associated incidence matrices (Q2244886) (← links)
• On Maltsev digraphs (Q2260621) (← links)
• Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
• Posets with maximal Möbius function (Q2277456) (← links)
• Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
• Improving selfish routing for risk-averse players (Q2300632) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• NodeTrix planarity testing with small clusters (Q2319629) (← links)
• Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
• Convex generalized flows (Q2352786) (← links)
• Describing the local structure of sequence graphs (Q2364898) (← links)
• Resource allocation via dynamic programming in activity networks (Q2366080) (← links)
• The two-machine flow shop problem with arbitrary precedence relations (Q2366083) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
• Entropic uniform sampling of linear extensions in series-parallel posets (Q2399366) (← links)
• Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
• An optimal algorithm for an outerplanar facility location problem with improved time complexity (Q2424182) (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
• Retractions onto series-parallel posets (Q2483392) (← links)
• Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
• On budget-constrained flow improvement. (Q2583570) (← links)
• The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)
• The connected critical node problem (Q2672625) (← links)
• Robust minimum cost flow problem under consistent flow constraints (Q2673801) (← links)
• Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
• Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300) (← links)