Study titled ″Popular Matchings in Complete Graphs″ by Ágnes Cseh & Telikepalli Kavitha published in Algorithmica
01/27/2021 | 10:51
Published: 25 January 2021
Cseh, Á., Kavitha, T. : Popular Matchings in Complete Graphs. Algorithmica (2021).
An instance that admits two popular matchings—marked by dotted blue and dashed orange edges—but no stable matching. The preference list of each vertex is illustrated by the numbers on its edges: a lower number indicates a more preferred neighbor (Color figure online)
Events
Featured news
New study by Ágnes Óvári and co-authors in Waste Management scientific journal
This study focuses on a comprehensive sustainability assessment of the management of the organic fraction of municipal solid waste in Ghent (Belgium), Hamburg (Germany) and Pécs (Hungary). A sustainability assessment framework has been applied to analyse social, environmental, and economic consequences at the midpoint level (25 impact categories) and at the endpoint level (5 areas-of-protection).
- 07/29/2021
- Read more
Book chapter by Ágnes Szunomár and Tamás Peragovics in Western Balkans Playbook - Competition for influence among foreign actors
Edited by: Gergely Varga and Tamás Levente Molnár
Published by the Institute for Foreign Affairs and Trade (Budapest, 2021)
- 07/26/2021
- Read more
Conference presentations by Zoltán Bakucs, Lajos Baráth, Zsófia Benedek and Imre Fertő on the 16th Congress of the European Association of Agricultural Economists
After its postponement due to the Covid-19 crisis, the Congress took place 20-23 July 2021 in an online format.
The theme was: Raising the Impact of Agricultural Economics: Multidisciplinarity, Stakeholder Engagement and Novel Approaches
- 07/26/2021
- Read more