Complexity of finding graph roots with girth conditions (Q2428666)

From MaRDI portal
Revision as of 02:36, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of finding graph roots with girth conditions
scientific article

    Statements

    Complexity of finding graph roots with girth conditions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    graph roots
    0 references
    graph powers
    0 references
    recognition algorithms
    0 references
    NP-completeness
    0 references

    Identifiers