Pages that link to "Item:Q1887072"
From MaRDI portal
The following pages link to The weighted independent domination problem is NP-complete for chordal graphs (Q1887072):
Displaying 13 items.
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Independent domination versus weighted independent domination (Q2294440) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches (Q3304199) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
