Independent domination in finitely defined classes of graphs
From MaRDI portal
Publication:1399990
DOI10.1016/S0304-3975(02)00586-8zbMath1028.68061MaRDI QIDQ1399990
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
Independent domination in hereditary classes ⋮ On the independent dominating set polytope ⋮ More results on weighted independent domination ⋮ Tree-Width and Optimization in Bounded Degree Graphs ⋮ Boundary Classes of Planar Graphs ⋮ NP-hard graph problems and boundary classes of graphs ⋮ Independent domination in finitely defined classes of graphs: polynomial algorithms ⋮ Independent sets in extensions of 2\(K_{2}\)-free graphs ⋮ On the inapproximability of independent domination in \(2P_3\)-free perfect graphs ⋮ Independent domination versus weighted independent domination ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ Mind the independence gap ⋮ Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination in convex and chordal bipartite graphs
- On domination problems for permutation and other graphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Independent domination in chordal graphs
- Modular decomposition and transitive orientation
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- On semi-\(P_ 4\)-sparse graphs
- A nice class for the vertex packing problem
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Bipartite graphs without a skew star
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- On the vertex packing problem
- Handle-rewriting hypergraph grammars
- Domination on Cocomparability Graphs
- On graphs with polynomially solvable maximum-weight clique problem
- Some classes of perfectly orderable graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
This page was built for publication: Independent domination in finitely defined classes of graphs
