On total \(f\)-domination: polyhedral and algorithmic results
From MaRDI portal
Publication:1732100
DOI10.1016/j.dam.2018.11.021zbMath1407.05175OpenAlexW2904725895MaRDI QIDQ1732100
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.021
Trees (05C05) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A polyhedral view to a generalization of multiple domination ⋮ On \(f\)-domination: polyhedral and algorithmic results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total domination and transformation
- Invariants concerning \(f\)-domination in graphs
- Domination, independent domination, and duality in strongly chordal graphs
- On unimodular graphs
- Domination in convex and chordal bipartite graphs
- A survey of selected recent results on total domination in graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- The complexity of domination problems in circle graphs
- Disjunctive programming: Properties of the convex hull of feasible points
- Near-perfect matrices
- One-node cutsets and the dominating set polytope
- Time bounds for selection
- Combinatorial Optimization
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Domination on Cocomparability Graphs
- On the Algorithmic Complexity of Total Domination
- Total Domination and Irredundance in Weighted Interval Graphs
- Total domination in graphs
- Dominating Sets in Chordal Graphs
- Total Domination in Graphs
- Integral Extreme Points
