An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3138955544 / rank
 
Normal rank

Revision as of 03:23, 20 March 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
    0 references
    graphical degree sequence
    0 references
    bipartite realization
    0 references
    0 references