\((1, j)\)-set problem in graphs (Q294556)
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: (1, j)-set problem in graphs |
scientific article; zbMATH DE number 6593971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((1, j)\)-set problem in graphs |
scientific article; zbMATH DE number 6593971 |
Statements
\((1, j)\)-set problem in graphs (English)
0 references
16 June 2016
0 references
domination
0 references
\((1, j)\)-set
0 references
NP-completeness
0 references
probabilistic method
0 references
chordal graph
0 references
0 references
0.8318873643875122
0 references
0.8074732422828674
0 references
0.7514584064483643
0 references
0.7445424795150757
0 references
0.7311075925827026
0 references
