Large Discrete Structures
(LaDIST)
Start date: Dec 1, 2015,
End date: Nov 30, 2020
PROJECT
FINISHED
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.
Get Access to the 1st Network for European Cooperation
Log In
or
Create an account
to see this content
Coordinator
THE UNIVERSITY OF WARWICK
€ 1 386 859,00- Kirby Corner Road - University House CV4 8UW COVENTRY (United Kingdom)
Details
- 100% € 1 386 859,00
-
H2020-EU.1.1.
- Project on CORDIS Platform