LaDIST | Large Discrete Structures

Summary
The proposed project seeks to introduce novel methods to analyze and approximate large graphs and other discrete structures and to apply the developed methods to solve specific open problems. A need for such methods comes from computer science where the sizes of input structures are often enormous. Specifically, the project will advance the recently emerged theory of combinatorial limits by developing new insights in the structure of limit objects and by proposing a robust theory bridging the sparse and dense cases. The analytic methods from the theory of combinatorial limits will be used to analyze possible asymptotic behavior of large graphs and they will be applied in conjunction with structural arguments to provide solutions to specific problems in extremal combinatorics. The obtained insights will also be combined with methods from discrete optimization and logic to provide new algorithmic frameworks.
Unfold all
/
Fold all
More information & hyperlinks
Web resources: https://cordis.europa.eu/project/id/648509
Start date: 01-12-2015
End date: 31-12-2021
Total budget - Public funding: 1 386 859,00 Euro - 1 386 859,00 Euro
Cordis data

Original description

The proposed project seeks to introduce novel methods to analyze and approximate large graphs and other discrete structures and to apply the developed methods to solve specific open problems. A need for such methods comes from computer science where the sizes of input structures are often enormous. Specifically, the project will advance the recently emerged theory of combinatorial limits by developing new insights in the structure of limit objects and by proposing a robust theory bridging the sparse and dense cases. The analytic methods from the theory of combinatorial limits will be used to analyze possible asymptotic behavior of large graphs and they will be applied in conjunction with structural arguments to provide solutions to specific problems in extremal combinatorics. The obtained insights will also be combined with methods from discrete optimization and logic to provide new algorithmic frameworks.

Status

CLOSED

Call topic

ERC-CoG-2014

Update Date

27-04-2024
Images
No images available.
Geographical location(s)
Structured mapping
Unfold all
/
Fold all
Horizon 2020
H2020-EU.1. EXCELLENT SCIENCE
H2020-EU.1.1. EXCELLENT SCIENCE - European Research Council (ERC)
ERC-2014
ERC-2014-CoG
ERC-CoG-2014 ERC Consolidator Grant