Optimal stopping for many connected components in a graph (Q6074658)
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 7749488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal stopping for many connected components in a graph |
scientific article; zbMATH DE number 7749488 |
Statements
Optimal stopping for many connected components in a graph (English)
0 references
12 October 2023
0 references
connected component
0 references
\(k\)-tree
0 references
optimal stopping
0 references
0 references
0.8452625274658203
0 references
0.7827681303024292
0 references
0.7001066207885742
0 references
0.6927481293678284
0 references
0.6883147358894348
0 references
