Superfluous paths in strong digraphs (Q594892): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q594890 / rank
Normal rank
 
Property / author
 
Property / author: Cláudio Leonardo Lucchesi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified treatment of nearly reducible and nearly decomposable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 2-connected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally strong digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exponent of a Primitive, Nearly Reducible Matrix. II / rank
 
Normal rank

Latest revision as of 10:05, 14 June 2024

scientific article
Language Label Description Also known as
English
Superfluous paths in strong digraphs
scientific article

    Statements

    Superfluous paths in strong digraphs (English)
    0 references
    1983
    0 references
    strongly connected digraph
    0 references
    branch
    0 references

    Identifiers