Pages that link to "Item:Q3792718"
From MaRDI portal
The following pages link to Total Domination and Irredundance in Weighted Interval Graphs (Q3792718):
Displayed 18 items.
- Irredundancy in circular arc graphs (Q686248) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Weighted irredundance of interval graphs. (Q2583539) (← 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)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
- Minimum dominating sets of intervals on lines (Q6064049) (← links)