Local Algorithms for Graphs

We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the structure of the whole graph and maybe added some randomnes...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Gamarnik, David, Hemery, Mathieu, Hetterich, Samuel
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Physics - Disordered Systems and Neural Networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!