Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620)
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 5939530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries |
scientific article; zbMATH DE number 5939530 |
Statements
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (English)
0 references
16 August 2011
0 references
learning by queries
0 references
degree sequence
0 references
sampling
0 references
sparse graph
0 references
dominating set
0 references
0.730410099029541
0 references
0.7293720245361328
0 references
0.7134157419204712
0 references
0.7076901793479919
0 references
