Finding a minimum independent dominating set in a permutation graph
From MaRDI portal
Recommendations
- An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
- scientific article; zbMATH DE number 1222845
- A new approach for the domination problem on permutation graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Fast algorithms for the dominating set problem on permutation graphs
Cites work
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- An efficient algorithm for maxdominance, with applications
- Domination in permutation graphs
- Maintenance of configurations in the plane
- Some beautiful arguments using mathematical induction
- Some modified algorithms for Dijkstra's longest upsequence problem
Cited in
(16)- The weighted maximum independent set problem in permutation graphs
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
- Coloring permutation graphs in parallel
- The complexity of domination problems in circle graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On-line algorithms for the dominating set problem
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Generate all maximal independent sets in permutation graphs
- Fast algorithms for the dominating set problem on permutation graphs
- On the feedback vertex set problem in permutation graphs
- A new approach for the domination problem on permutation graphs
- A theorem on permutation graphs with applications
- An efficient algorithm for maxdominance, with applications
- A resource assignment problem on graphs
- Finding minimum dominating cycles in permutation graphs
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
This page was built for publication: Finding a minimum independent dominating set in a permutation graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117255)
