scientific article; zbMATH DE number 5237261
From MaRDI portal
Publication:5443191
zbMATH Open1145.05043MaRDI QIDQ5443191FDOQ5443191
Authors: Lindsay H. Jamieson, Brian C. Dean 
Publication date: 20 February 2008
Title of this publication is not available (Why is that?)
Recommendations
- Small alliances in a weighted graph
- scientific article; zbMATH DE number 2104820
- Alliances in directed graphs
- Powerful alliances in graphs
- Strong alliances in graphs
- Algorithms and Complexity of Alliances in Graphs
- The algorithmic complexity of alliances in graphs
- Alliances in graphs of bounded clique-width
- Alliances in graphs: parameters, properties and applications -- a survey
- On weighted clique graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (8)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Linear time algorithms for weighted offensive and powerful alliances in trees
- A fast algorithm for powerful alliances in trees
- Alliances in graphs of bounded clique-width
- \((F, I)\)-security in graphs
- Small alliances in a weighted graph
- Alliances in generalized series parallel graphs
- Algorithms and Complexity of Alliances in Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443191)
