Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (Q1201873)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies |
scientific article; zbMATH DE number 98614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian graphs with minimum number of edges for fault-tolerant topologies |
scientific article; zbMATH DE number 98614 |
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
0.7989828586578369
0 references
0.7978538870811462
0 references
0.7965139746665955
0 references
0.7957049608230591
0 references
0.7935941815376282
0 references
