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):
Displaying 50 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- 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)
- Small grid drawings of planar graphs with balanced partition (Q695321) (← 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)
- Optimal packet scan against malicious attacks in smart grids (Q896159) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Partitioning graphs of supply and demand (Q967306) (← 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)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← 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)
- Recognition of directed acyclic graphs by spanning tree automata (Q1959657) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- Computing equilibrium in network utility-sharing and discrete election games (Q2082218) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
