Pages that link to "Item:Q5177036"
From MaRDI portal
The following pages link to A survey on alliances and related parameters in graphs (Q5177036):
Displaying 20 items.
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- New sharp lower bound for the quorum coloring number of trees (Q2169434) (← links)
- Global defensive alliances in the lexicographic product of paths and cycles (Q2192075) (← links)
- Upper bounds on the global offensive alliances in graphs (Q2217469) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- Globally minimal defensive alliances (Q2671799) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- (Q4604351) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- k-STRONG DEFENSIVE ALLIANCES IN GRAPHS (Q6149003) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
