MaxDDBS problem on butterfly networks (Q4595226)
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 6813628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MaxDDBS problem on butterfly networks |
scientific article; zbMATH DE number 6813628 |
Statements
29 November 2017
0 references
maximum degree-diameter bounded subgraph problem
0 references
degree-diameter problem
0 references
0.838718593120575
0 references
0.8193569779396057
0 references
0.7485697865486145
0 references
0.7468851208686829
0 references
0.7449579238891602
0 references
