Completely separable graphs (Q908944)
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 4136000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completely separable graphs |
scientific article; zbMATH DE number 4136000 |
Statements
Completely separable graphs (English)
0 references
1990
0 references
Boolean functions
0 references
separability
0 references
Completely separable graphs
0 references
liner time algorithms
0 references
recognition
0 references
optimization problems
0 references
maximum weighted stable set
0 references
maximum eighted clique
0 references
0.7862087488174438
0 references
0.7646073698997498
0 references
