Pages that link to "Item:Q6100186"
From MaRDI portal
The following pages link to Algorithmic aspects of paired disjunctive domination in graphs (Q6100186):
Displaying 5 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Analysis of Dehn's algorithm by critical pairs (Q1100558) (← links)
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)