An efficient algorithm to test potential bipartiteness of graphical degree sequences (Q4987152)
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: An efficient algorithm to test potential bipartiteness of graphical degree sequences |
scientific article; zbMATH DE number 7341077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to test potential bipartiteness of graphical degree sequences |
scientific article; zbMATH DE number 7341077 |
Statements
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (English)
0 references
28 April 2021
0 references
graphical degree sequence
0 references
bipartite realization
0 references
0.7677879929542542
0 references
0.7671386003494263
0 references
0.7619351148605347
0 references
