A Simple Proof of the Gross-Saccoman Multigraph Conjecture
An enigmatic conjecture in network synthesis asserts that the the uniformly most reliable multigraphs are simple. Daniel Gross and John Saccoman proved in 1998 that the answer is affirmative whenever m ≤ n + 2, where n and m is the respective number of nodes and edges of the multigraphs. They conjec...
Saved in:
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | article |
| Sprog: | engelsk |
| Udgivet: |
2022
|
| Fag: | |
| Online adgang: | https://hdl.handle.net/20.500.12381/701 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
Lignende værker: A Simple Proof of the Gross-Saccoman Multigraph Conjecture
- The Gross-Saccoman Conjecture is True
- Universal Reliability Bounds for Sparse Networks
- Uniformly Optimally Reliable Graphs: A Survey
- GRASP/VND Optimization Algorithms for Hard Combinatorial Problems
- Grafos uniformemente más confiables. Una prueba simple de la conjetura de Gross-Saccoman.
- Diameter-constrained reliability : theory and applications