Skip to main content

Sublinear algorithms for the analysis of very large graphs

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.

Call for proposal

ERC-2012-StG_20111012
See other projects for this call

Funding Scheme

ERC-SG - ERC Starting Grant

Host institution

TECHNISCHE UNIVERSITAT DORTMUND
Address
August Schmidt Strasse 4
44227 Dortmund
Germany
Activity type
Higher or Secondary Education Establishments
EU contribution
€ 1 475 306
Principal investigator
Christian Sohler (Prof.)
Administrative Contact
Esther Rahma (Ms.)

Beneficiaries (1)

TECHNISCHE UNIVERSITAT DORTMUND
Germany
EU contribution
€ 1 475 306
Address
August Schmidt Strasse 4
44227 Dortmund
Activity type
Higher or Secondary Education Establishments
Principal investigator
Christian Sohler (Prof.)
Administrative Contact
Esther Rahma (Ms.)