A linear algorithm for the domination number of a tree
From MaRDI portal
(Redirected from Publication:1219556)
Cited in
(only showing first 100 items - show all)- \(k\)-tuple domination in graphs
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
- Dominating sets and domatic number of circular arc graphs
- Clustering and domination in perfect graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- Labeling algorithms for domination problems in sun-free chordal graphs
- Total domination in block graphs
- Independent domination in chordal graphs
- R-domination of block graphs
- Dominating sets in perfect graphs
- On minimum dominating sets with minimum intersection
- Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- On the \(r\)-domination number of a graph
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- Optimum domination in weighted trees
- Linear algorithms on recursive representations of trees
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- The domatic number problem
- The diversity of domination
- And/or-convexity: a graph convexity based on processes and deadlock models
- On independent \([1, 2]\)-sets in trees
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
- Mixed Roman domination in graphs
- Laplacian distribution and domination
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- Constrained domatic bipartition on trees
- A linear algorithm for the domination number of a series-parallel graph
- The weighted perfect domination problem and its variants
- Liar's domination in graphs: complexity and algorithm
- -graphs of trees
- Paired-domination problem on distance-hereditary graphs
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- Induced star partition of graphs
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- A polynomial-time approximation to a minimum dominating set in a graph
- On the vertices belonging to all, some, none minimum dominating set
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
- Layered graphs: applications and algorithms
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- An algorithm for the dominator chromatic number of a tree
- On some domination colorings of graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Majorization and the minimum number of dominating sets
- A linear algorithm for secure domination in trees
- Unconditionally secure key assignment schemes
- Unique irredundance, domination and independent domination in graphs
- Best location of service centers in a treelike network under budget constraints
- On the algorithmic complexity of edge total domination
- Covering, Packing and Generalized Perfection
- On the (M, D) number of a graph
- Two algorithms for determining a minimum independent dominating set
- The private neighbor concept
- Algorithms and complexity of power domination in graphs
- Dominating sets of random recursive trees
- Extensions of the Minimum Dominating Set Problem
- On the Algorithmic Complexity of Total Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Minimum dominating cycles in 2-trees
- Partitioning trees: Matching, domination, and maximum diameter
- Some upper bounds related with domination number
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Domination cover number of graphs
- Computational complexity analysis of the sensor location flow observability problem
- scientific article; zbMATH DE number 7481760 (Why is no real title available?)
- A note on an induced subgraph characterization of domination perfect graphs
- The strong domination problem in block graphs and proper interval graphs
- Approximating the Spanning k-Tree Forest Problem
- The algorithmic complexity of mixed domination in graphs
- scientific article; zbMATH DE number 7057230 (Why is no real title available?)
- Broadcasts and domination in trees
- A linear time algorithm for minimum equitable dominating set in trees
- scientific article; zbMATH DE number 7666856 (Why is no real title available?)
- Dominating cliques in graphs
- Dominating cliques in graphs
- Domination in distance-hereditary graphs
- An efficient algorithm for distance total domination in block graphs
- \(k\)-power domination in block graphs
- Star covers and star partitions of double-split graphs
- Towards a new framework for domination
- A linear algorithm for the neighbor-component order connectivity of arbitrary trees
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- On approximation of multiple intruder locating domination number of a graph
- Autonomous domination
- Partial domination in some geometric intersection graphs
- An algorithm for the domination number and neighbor-component order connectivity of a unicycle
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Approximation algorithms for double domination number of graphs
- On random trees obtained from permutation graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Combinatorial aspects of the sensor location problem
- On unique minimum dominating sets in some Cartesian product graphs
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- Cores of simplicial complexes
- On the geodetic and geodetic domination numbers of a graph
This page was built for publication: A linear algorithm for the domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1219556)