Pages that link to "Item:Q4728259"
From MaRDI portal
The following pages link to Linear-time computation of optimal subgraphs of decomposable graphs (Q4728259):
Displaying 50 items.
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Efficient sets in graphs (Q686251) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← 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)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Converting triangulations to quadrangulations (Q1384213) (← links)
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus (Q1387702) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Irredundance (Q3384112) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- A note on trees, tables, and algorithms (Q5191139) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479828) (← links)
