Sublinear algorithms for the analysis of very large graphs
(Sublinear)
Start date: Dec 1, 2012,
End date: Nov 30, 2017
PROJECT
FINISHED
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.
Get Access to the 1st Network for European Cooperation
Log In
or
Create an account
to see this content
Details
- 100% € 1 475 306,00
-
FP7-IDEAS-ERC
- Project on CORDIS Platform
TECHNISCHE UNIVERSITAT DORTMUND
€ 1 475 306,00- Michael Lohmeier
- AUGUST SCHMIDT STRASSE 4 44227 DORTMUND (Germany)