An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
From MaRDI portal
(Redirected from Publication:4985488)
An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
Recommendations
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- The k-hop connected dominating set problem: hardness and polyhedra
- The k-hop connected dominating set problem: approximation and hardness
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
Cites work
- scientific article; zbMATH DE number 1248191 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1472188 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- R -Domination in Graphs
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Algorithmic aspect of k-tuple domination in graphs.
- Algorithmic graph theory and perfect graphs
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- An optimal greedy heuristic to color interval graphs
- Bounds on the hop domination number of a tree
- Breadth-first traversal of trees and integer sorting in parallel
- Depth-First Search and Linear Graph Algorithms
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Domination critical graphs
- Dynamic monopolies of constant size
- Edge Dominating Sets in Graphs
- Hop domination in graphs. II
- Incremental modular decomposition
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Locating and paired-dominating sets in graphs
- Minimum 2-tuple dominating set of an interval graph
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- On 2-step and hop dominating sets in graphs
- On the complexity of \(k\)-step and \(k\)-hop dominating sets in graphs
- Paired domination on interval and circular-arc graphs
- Paired-domination in graphs
- Paired-domination in inflated graphs
- Paired-domination of trees
- Perfect edge domination and efficient edge domination in graphs
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- The k-tuple twin domination in generalized de Bruijn and Kautz networks
- The weighted independent domination problem is NP-complete for chordal graphs
- Topics on domination
- Total Domination Edge Critical Graphs with Maximum Diameter
- Total Domination and Irredundance in Weighted Interval Graphs
- Total domination in graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Weighted domination of cocomparability graphs
- \(k\)-tuple domination in graphs
Cited in
(9)- The k-hop connected dominating set problem: approximation and hardness
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- The k-hop connected dominating set problem: hardness and polyhedra
- Two algorithms for minimum 2-connected r-hop dominating set
- Finding minimum dominating cycles in permutation graphs
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- Computation of diameter, radius and center of permutation graphs
- Edge-vertex domination on interval graphs
This page was built for publication: An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985488)
