Independent domination in finitely defined classes of graphs: polynomial algorithms

DOI10.1016/J.DAM.2013.08.030MaRDI QIDQ2255037zbMATH OpenOpenAlexFDO

Authors Vadim Lozin, Raffaele Mosca, Christopher Purcell

Publication date 6 February 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.08.030

zbMATH Keywords

finitely defined class of graphsindependent dominationpolynomial-time algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Independent domination in finitely defined classes of graphs
• Independent domination in hereditary classes
• Satgraphs and independent domination. I
• scientific article; zbMATH DE number 468640
• Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time

Cites work

• \(P_{5}\)-free augmenting graphs and the maximum stable set problem
• An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
• An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
• Augmenting graphs for independent sets
• Domination in convex and chordal bipartite graphs
• Edge Dominating Sets in Graphs
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Independent domination in chordal graphs
• Independent domination in finitely defined classes of graphs
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Maximum independent sets in subclasses of \(P_{5}\)-free graphs
• Modular decomposition and transitive orientation
• On algorithms for (P₅, gem)-free graphs
• On diameters and radii of bridged graphs
• On finding augmenting graphs
• On independent vertex sets in subclasses of apple-free graphs
• On maximum independent sets in \(P_{5}\)-free graphs
• On the vertex packing problem
• On the X-join decomposition for undirected graphs
• Satgraphs and independent domination. I
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
• Some results on maximum stable sets in certain \(P_{5}\)-free graphs
• Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
• The weighted independent domination problem is NP-complete for chordal graphs
• Transitiv orientierbare Graphen

Cited in

(11)

• Independent domination in finitely defined classes of graphs
• Independent domination versus weighted independent domination
• An algorithm for calculating the independence and vertex-cover polynomials of a graph
• More results on weighted independent domination
• A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
• Iterative construction of the minimum independent dominating sets in hypercube graphs
• Complexity of the approximation of the independent dominating set problem in the class of 2P₃-free perfect graphs
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
• scientific article; zbMATH DE number 6460018 (Why is no real title available?)
• Mind the independence gap
• Satgraphs and independent domination. I

This page was built for publication: Independent domination in finitely defined classes of graphs: polynomial algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255037)