Linear-time computation of optimal subgraphs of decomposable graphs
From MaRDI portal
Recommendations
Cited in
(72)- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
- Tangle bases: Revisited
- Branch decomposition heuristics for linear matroids
- Regular-factors in the complements of partial k-trees
- Definability equals recognizability of partial 3-trees
- A note on trees, tables, and algorithms
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Width, depth, and space: tradeoffs between branching and dynamic programming
- Irredundance
- The price of anarchy in series-parallel network congestion games
- Optimal parametric search on graphs of bounded tree-width
- Tree-edges deletion problems with bounded diameter obstruction sets
- \(k\)-NLC graphs and polynomial algorithms
- Dynamic algorithms for graphs of bounded treewidth
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
- Complexity of path-forming games
- Maximal irredundant functions
- Cycle-maximal triangle-free graphs
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
- Improving spanning trees by upgrading nodes
- On minimum dominating sets with minimum intersection
- New limits of treewidth-based tractability in optimization
- Generalized coloring for tree-like graphs
- Sublinear randomized algorithms for skeleton decompositions
- Complexity analysis for maximum flow problems with arc reversals
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Tree decompositions and social graphs
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree
- Practical algorithms on partial k-trees with an application to domination-like problems
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Treewidth computations. I: Upper bounds
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Efficiently parallelizable problems on a class of decomposable graphs
- Algorithm to find a maximum 2-packing set in a cactus
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
- Monadic second-order evaluations on tree-decomposable graphs
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Converting triangulations to quadrangulations
- Parametric problems on graphs of bounded tree-width
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- LP formulations for polynomial optimization problems
- Convex dominating sets in maximal outerplanar graphs
- Efficient sets in graphs
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- Gainfree Leontief substitution flow problems
- Cross-series-parallel digraphs
- On budget-constrained flow improvement.
- Using maximality and minimality conditions to construct inequality chains
- Modifying edges of a network to obtain short subgraphs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Parallel recognition of series-parallel graphs
- The role of Steiner hulls in the solution to Steiner tree problems
- A partial k-arboretum of graphs with bounded treewidth
- Regularity and locality in \(k\)-terminal graphs
- Minimum-maximal matching in series-parallel graphs
- Nonserial dynamic programming formulations of satisfiability
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- scientific article; zbMATH DE number 3974289 (Why is no real title available?)
- Fixed-parameter tractability of treewidth and pathwidth
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Efficient algorithms for solving systems of linear equations and path problems
- Improved Steiner tree algorithms for bounded treewidth
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- scientific article; zbMATH DE number 4049086 (Why is no real title available?)
- A linear‐time algorithm for broadcast domination in a tree
- Matchability and \(k\)-maximal matchings
- A branch-and-price-and-cut method for computing an optimal bramble
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Linear-time computation of optimal subgraphs of decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728259)
