Sublinear algorithms for the analysis of very large graphs
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 network...
ver más
¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video
Proyectos interesantes
QRGRAPH
Quasirandomness in Graphs and Hypergraphs
743K€
Cerrado
PROXNET
Modelling Complex Networks Through Graph Editing Problems
208K€
Cerrado
TIN2013-47008-R
BENCHMARKING, APPLICATIONS AND TECHNOLOGY FOR GRAPH MANAGEME...
39K€
Cerrado
MoDynStruct
The design and evaluation of modern fully dynamic data struc...
2M€
Cerrado
DYNAMICMARCH
Dynamics of Multiple Interacting and Concurrent Markov Chai...
1M€
Cerrado
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
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.