Pages that link to "Item:Q1099628"
From MaRDI portal
The following pages link to The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628):
Displaying 50 items.
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- The general facility location problem with connectivity on trees (Q335115) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the terminal connection problem (Q831820) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Mobile versus point guards (Q1716007) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- A note on the complexity of locating-total domination in graphs (Q2333807) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Connected Domination (Q3384607) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
