Correction: Basic Network Creation Games

Correction: Basic Network Creation Games

We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics 2014-01, Vol.28 (3), p.1638-1640
Hauptverfasser: Alon, Noga, Demaine, Erik D., Hajiaghayi, MohammadTaghi, Kanellopoulos, Panagiotis, Leighton, Tom
Format: Artikel
Sprache:eng
Schlagworte:
Games
Graphs
Mathematical analysis
Networks
Theorems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).
ISSN:0895-4801
1095-7146
DOI:10.1137/140955343