Partitioning a graph into alliance free sets (Q1025928)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5569055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into alliance free sets |
scientific article; zbMATH DE number 5569055 |
Statements
Partitioning a graph into alliance free sets (English)
0 references
23 June 2009
0 references
alliance
0 references
defensive alliance
0 references
alliance-free set
0 references
alliance cover set
0 references
vertex partition
0 references
0 references
0.8581390380859375
0 references
0.8389552235603333
0 references
0.810998797416687
0 references
