Pages that link to "Item:Q750166"
From MaRDI portal
The following pages link to A new approach for the domination problem on permutation graphs (Q750166):
Displaying 12 items.
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- The minimum weight dominating set problem for permutation graphs is in NC (Q1898177) (← links)
- On the broadcast domination number of permutation graphs (Q2285130) (← links)
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563) (← links)
- (Q3715153) (← links)
- Parallel algorithms on circular-arc graphs (Q5917729) (← links)