Pages that link to "Item:Q1078205"
From MaRDI portal
The following pages link to A linear algorithm for finding a minimum dominating set in a cactus (Q1078205):
Displayed 22 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- On the dominating set polytope (Q2426444) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- Graphs with unique dominating sets (Q2816086) (← links)
- (Q2861547) (← links)
- (Q4443258) (← links)
- (Q5037236) (← links)
- SIGNED STAR DOMINATION IN GRAPHS (Q5076089) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- (Q5376962) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)