Pages that link to "Item:Q6110593"
From MaRDI portal
The following pages link to A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593):
Displaying 7 items.
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- The semitotal domination problem in block graphs (Q2062683) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Semipaired Domination in Some Subclasses of Chordal Graphs (Q5038198) (← links)