Pages that link to "Item:Q1219556"
From MaRDI portal
The following pages link to A linear algorithm for the domination number of a tree (Q1219556):
Displaying 50 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Some upper bounds related with domination number (Q457547) (← links)
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- Towards a new framework for domination (Q651449) (← links)
- On random trees obtained from permutation graphs (Q738839) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Combinatorial aspects of the sensor location problem (Q867553) (← links)
- On unique minimum dominating sets in some Cartesian product graphs (Q891308) (← links)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- R-domination of block graphs (Q1171499) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs (Q1178247) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- On the \(r\)-domination number of a graph (Q1197015) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- Optimum domination in weighted trees (Q1251239) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- The domatic number problem (Q1322260) (← links)
- The diversity of domination (Q1356420) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree (Q1679914) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- Laplacian distribution and domination (Q1684945) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- Constrained domatic bipartition on trees (Q1751203) (← links)
- A linear algorithm for the domination number of a series-parallel graph (Q1837213) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- \(\gamma\)-graphs of trees (Q2005551) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)