Linear separation of connected dominating sets in graphs (Q5225055)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear separation of connected dominating sets in graphs |
scientific article; zbMATH DE number 7085346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear separation of connected dominating sets in graphs |
scientific article; zbMATH DE number 7085346 |
Statements
Linear separation of connected dominating sets in graphs (English)
0 references
25 July 2019
0 references
connected dominating set
0 references
connected domination
0 references
connected-domishold graph
0 references
forbidden induced subgraph characterization
0 references
split graph
0 references
chordal graph
0 references
minimal cutset
0 references
minimal separator
0 references
1-Sperner hypergraph
0 references
threshold hypergraph
0 references
threshold Boolean function
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.8409156203269958
0 references
0.7870999574661255
0 references
0.7795788645744324
0 references
