Structure of squares and efficient domination in graph classes
From MaRDI portal
Publication:338382
DOI10.1016/j.tcs.2016.09.002zbMath1353.05094OpenAlexW2519091437MaRDI QIDQ338382
Publication date: 4 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.002
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Distance regular subgraphs of a cube
- Maximum weight independent sets in hole- and dart-free graphs
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
- The weighted perfect domination problem
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Computing roots of graphs is hard
- Weighted efficient domination problem on some perfect graphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Perfect codes in the graphs \(O_k\)
- The weighted perfect domination problem and its variants
- Efficient domination for classes of \(P_6\)-free graphs
- New Polynomial Cases of the Weighted Efficient Domination Problem
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Graph Classes: A Survey
- Dominating sets in n‐cubes
- Independence and Efficient Domination on P6-free Graphs
- New Polynomial Case for Efficient Domination in P 6-free Graphs
- Multiplying matrices faster than coppersmith-winograd
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
This page was built for publication: Structure of squares and efficient domination in graph classes
