Explore the words cloud of the PROXNET project. It provides you a very rough idea of what is the project "PROXNET" about.
The following table provides information about the project.
Coordinator |
UNIVERSITETET I BERGEN
Organization address contact info |
Coordinator Country | Norway [NO] |
Total cost | 208˙400 € |
EC max contribution | 208˙400 € (100%) |
Programme |
1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility) |
Code Call | H2020-MSCA-IF-2016 |
Funding Scheme | MSCA-IF-EF-ST |
Starting year | 2018 |
Duration (year-month-day) | from 2018-02-01 to 2020-01-31 |
Take a look of project's partnership.
# | ||||
---|---|---|---|---|
1 | UNIVERSITETET I BERGEN | NO (BERGEN) | coordinator | 208˙400.00 |
The goal of the PROXNET project, which will be realised during the mobility of Christophe Crespelle in the Algorithms group of Bergen, is to open a new way for analysing, modelling and managing complex networks, through graph editing problems. The reason why these networks are said to be complex is that they are loosely structured, due to the part of uncertainty and randomness they contain. On the other hand, the real-world context where they come from strongly constrains their organisation and gives them some specific structure. The difficulty in retrieving this structure is that it is altered by the noise resulting from the uncertainty and randomness that these networks contain. In the PROXNET project, we will retrieve the hidden structures of complex networks thanks to graph editing problems, which consist in changing some adjacencies of the graph in order to obtain a desired property. We will develop the algorithms necessary to solve graph editing problems relevant to our approach on huge instances of graphs, we will apply them to real-world datasets and use the results obtained in order to design new models of complex networks. One key theoretic challenge in this context is to optimally solve the editing problems considered, which are computationally difficult (NP-hard). A very promising technique to do so is preprocessing. It consists in reducing the size of the instance by applying some reduction rules, in such a way that the optimal solution on the reduced instance is the same as the one on the original instance. The Algorithms group of the University of bergen is a world-wide leader on this topic which will constitute the main training action of Christophe Crespelle during his mobility.
year | authors and title | journal | last update |
---|---|---|---|
2020 |
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry Faster and Enhanced Inclusion-Minimal Cograph Completion published pages: , ISSN: , DOI: |
arXiv | 2020-04-03 |
2020 |
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach A survey of parameterized algorithms and the complexity of edge modification published pages: , ISSN: , DOI: |
arXiv | 2020-04-03 |
2019 |
Christophe Crespelle, Carl Feghali and Petr Golovach Cyclability in Graph Classes published pages: , ISSN: , DOI: |
30th International Symposium on Algorithms and Computation – ISAAC 2019 | 2020-04-03 |
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "PROXNET" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "PROXNET" are provided by the European Opendata Portal: CORDIS opendata.