SUBLINEAR
Sublinear algorithms for the analysis of very large graphs
| Coordinatore | TECHNISCHE UNIVERSITAT DORTMUND
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Germany [DE] |
| Totale costo | 1˙475˙306 € |
| EC contributo | 1˙475˙306 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2012-StG_20111012 |
| Funding Scheme | ERC-SG |
| Anno di inizio | 2012 |
| Periodo (anno-mese-giorno) | 2012-12-01 - 2017-11-30 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
TECHNISCHE UNIVERSITAT DORTMUND
Organization address
address: AUGUST SCHMIDT STRASSE 4 contact info |
DE (DORTMUND) | hostInstitution | 1˙475˙306.00 |
| 2 |
TECHNISCHE UNIVERSITAT DORTMUND
Organization address
address: AUGUST SCHMIDT STRASSE 4 contact info |
DE (DORTMUND) | hostInstitution | 1˙475˙306.00 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'Large graphs appear in many application areas. Typical examples are the webgraph, the internet graph, friendship graphs of social networks like facebook or Google, citation graphs, collaboration graphs, and transportation networks. The structure of these graphs contains valuable information but their size makes them very hard to analyze. We need special algorithm that analyze the graph structure via random sampling. The main objective of the proposed project is to advance our understanding of the foundations of sampling processes for the analysis of the structure of large graphs. We will use the approach of Property Testing, a theoretical framework to analyze such sampling algorithms.'