Pages that link to "Item:Q5918285"
From MaRDI portal
The following pages link to Complexity and algorithms for semipaired domination in graphs (Q5918285):
Displaying 11 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- Unique minimum semipaired dominating sets in trees (Q2107740) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Solving NP-hard semirandom graph problems in polynomial expected time (Q3437092) (← links)
- Semipaired Domination in Some Subclasses of Chordal Graphs (Q5038198) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
- (Q5919474) (redirect page) (← links)