Pages that link to "Item:Q2053252"

The following pages link to An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252):

Displaying 1 item.

• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)