Computing square roots of graphs with low maximum degree (Q2413970)

From MaRDI portal
Revision as of 05:44, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Computing square roots of graphs with low maximum degree
scientific article

    Statements

    Computing square roots of graphs with low maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2018
    0 references
    square root
    0 references
    bounded degree graph
    0 references
    polynomial algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references