An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3138955544 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1908.06821 / rank | |||
Normal rank | |||
Latest revision as of 21:18, 19 April 2024
scientific article; zbMATH DE number 7341077
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
