Easy and hard instances of arc ranking in directed graphs (Q2462400)

From MaRDI portal
Revision as of 12:44, 27 June 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
Easy and hard instances of arc ranking in directed graphs
scientific article

    Statements

    Easy and hard instances of arc ranking in directed graphs (English)
    0 references
    30 November 2007
    0 references
    graph ranking
    0 references
    digraph
    0 references
    computational complexity
    0 references
    caterpillar
    0 references

    Identifiers