Partitioning a graph into global powerful \(k\)-alliances (Q1926038): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57974355, #quickstatements; #temporary_batch_1714628707161 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57974355 / rank | |||
Normal rank | |||
Revision as of 06:45, 2 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into global powerful \(k\)-alliances |
scientific article |
Statements
Partitioning a graph into global powerful \(k\)-alliances (English)
0 references
27 December 2012
0 references
defensive \(k\)-alliances
0 references
offensive \(k\)-alliances
0 references
powerful \(k\)-alliances
0 references
Cartesian product graphs
0 references
