The fast search number of a complete \(k\)-partite graph (Q1799234)
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 6958257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The fast search number of a complete \(k\)-partite graph |
scientific article; zbMATH DE number 6958257 |
Statements
The fast search number of a complete \(k\)-partite graph (English)
0 references
18 October 2018
0 references
fast searching
0 references
complete \(k\)-partite graph
0 references
bipartite graph
0 references
split graph
0 references
0.9915528297424316
0 references
0.7966175675392151
0 references
0.7922512888908386
0 references
0.7842298150062561
0 references
0.7831853032112122
0 references
