Pages that link to "Item:Q2938747"
From MaRDI portal
The following pages link to Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747):
Displaying 16 items.
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs (Q6114823) (← links)
- (Q6155858) (← links)
- Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)