Pages that link to "Item:Q3945592"
From MaRDI portal
The following pages link to Linear-time computability of combinatorial problems on series-parallel graphs (Q3945592):
Displayed 48 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- On finding a minimum vertex cover of a series-parallel graph (Q758196) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Parallel recognition and decomposition of two terminal series parallel graphs (Q1098313) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Combinatorial problems on series-parallel graphs (Q1148685) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs (Q1263968) (← links)
- A note on the tour problems in two-terminal series-parallel graphs (Q1310922) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Combinatorial algorithms on a class of graphs (Q1336626) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Optimal location of a path or tree on a network with cycles (Q3202133) (← links)
- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (Q3637347) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451) (← links)
- Maximum independent number for series-parallel networks (Q3977271) (← links)
- (Q4540090) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479828) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)