Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969)
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: Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) |
scientific article; zbMATH DE number 984579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) |
scientific article; zbMATH DE number 984579 |
Statements
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (English)
0 references
27 February 1997
0 references
0 references
0.8600423
0 references
0 references
0 references
0 references
0.84632874
0 references
0.8426517
0 references
0.84153795
0 references
