Pages that link to "Item:Q476836"
From MaRDI portal
The following pages link to Independent dominating set problem revisited (Q476836):
Displaying 9 items.
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- The weighted independent domination problem is NP-complete for chordal graphs (Q1887072) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs (Q2837369) (← links)
- Algorithmic Aspects of Some Variants of Domination in Graphs (Q5002958) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)