Domination in permutation graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3943870
- A new approach for the domination problem on permutation graphs
- On domination problems for permutation and other graphs
- Fast algorithms for the dominating set problem on permutation graphs
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
Cited in
(63)- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Finding minimum dominating cycles in permutation graphs
- Dominating sets and domatic number of circular arc graphs
- Clustering and domination in perfect graphs
- Bipartite permutation graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- On domination problems for permutation and other graphs
- An efficient algorithm for maxdominance, with applications
- Labeling algorithms for domination problems in sun-free chordal graphs
- Finding a minimum independent dominating set in a permutation graph
- Total domination in block graphs
- Dominating sets in perfect graphs
- Permutation graphs: Connected domination and Steiner trees
- An optimal algorithm for finding dominating cycles in circular-arc graphs
- The weighted maximum independent set problem in permutation graphs
- Incorporating negative-weight vertices in certain vertex-search graph algorithms
- The complexity of domination problems in circle graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Parallel algorithms for permutation graphs
- Well-covered graphs and extendability
- A theorem on permutation graphs with applications
- On the feedback vertex set problem in permutation graphs
- One-node cutsets and the dominating set polytope
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Coloring permutation graphs in parallel
- The minimum weight dominating set problem for permutation graphs is in NC
- Domination and total domination on asteroidal triple-free graphs
- Paired-domination problem on distance-hereditary graphs
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Twin-width and polynomial kernels
- On dominating set of some subclasses of string graphs
- Induced star partition of graphs
- On the broadcast domination number of permutation graphs
- Fast algorithms for the dominating set problem on permutation graphs
- On the independent dominating set polytope
- On the dominating set polytope
- Polar SAT and related graphs
- Improved bottleneck domination algorithms
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
- Graph classes with structured neighborhoods and algorithmic applications
- scientific article; zbMATH DE number 3943870 (Why is no real title available?)
- scientific article; zbMATH DE number 4049081 (Why is no real title available?)
- Graph classes with structured neighborhoods and algorithmic applications
- A decidability result for the dominating set problem
- scientific article; zbMATH DE number 512913 (Why is no real title available?)
- Generate all maximal independent sets in permutation graphs
- Best and worst case permutations for random online domination of the path
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- Domination problems on \(P_{5}\)-free graphs
- scientific article; zbMATH DE number 6749463 (Why is no real title available?)
- Total domination in interval graphs
- Unique response Roman domination: complexity and algorithms
- Star covers and star partitions of double-split graphs
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Independence and domination in polygon graphs
- Computing residual connectedness reliability for restricted networks
- A new approach for the domination problem on permutation graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Independent domination in hereditary classes
- Finding a maximum independent set in a permutation graph
This page was built for publication: Domination in permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731637)
