Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (Q1201873)

From MaRDI portal
Revision as of 21:58, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
scientific article

    Statements

    Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (English)
    0 references
    17 January 1993
    0 references
    Hamiltonian graphs
    0 references
    distributed systems
    0 references
    fault-tolerance
    0 references
    node failure
    0 references
    Hamiltonian cycle
    0 references
    link failure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references