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):
Displayed 41 items.
- 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)
- Cores of simplicial complexes (Q958242) (← 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)
- A linear algorithm for the domination number of a series-parallel graph (Q1837213) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Unconditionally secure key assignment schemes (Q2489918) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Best location of service centers in a treelike network under budget constraints (Q2639769) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- Two algorithms for determining a minimum independent dominating set (Q3319782) (← links)
- Dominating sets of random recursive trees (Q3439556) (← links)
- Extensions of the Minimum Dominating Set Problem (Q3671200) (← links)
- On the Algorithmic Complexity of Total Domination (Q3696538) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- Minimum dominating cycles in 2-trees (Q3870930) (← links)
- Partitioning trees: Matching, domination, and maximum diameter (Q3916030) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- Dominating cliques in graphs (Q5925264) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)