Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices

Ioannis Panagiotas 1, 2, 3 
2 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 DATAMOVE - Data Aware Large Scale Computing
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This thesis investigates four different and related problems that arise in the area of Combinatorial Scientific Computing (CSC). The connecting link between the four examined problems is the fundamental problem of matching, which asks for the largest set of disjoint edges in a graph or hypergraph. These problems are that of maximum cardinality matching in graphs and hypergraphs, the estimation of the number of perfect matchings in graphs, and the Birkhoff–von Neumann decomposition of doubly stochastic matrices. The study of these problems is motivated by their usefulness in several domains and applications.We examine the four problems both theoretically as well as experimentally. The focus in theory allows us to discuss, analyze, and prove properties of the examined algorithms, while the experimental side of the thesis demonstrates the possible improvements and benefits of using the proposed algorithms and solutions.
Complete list of metadata

Cited literature [115 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Wednesday, November 18, 2020 - 11:48:22 AM
Last modification on : Wednesday, July 6, 2022 - 4:14:25 AM
Long-term archiving on: : Friday, February 19, 2021 - 7:06:11 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03011794, version 1


Ioannis Panagiotas. On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices. Data Structures and Algorithms [cs.DS]. Université de Lyon, 2020. English. ⟨NNT : 2020LYSEN068⟩. ⟨tel-03011794⟩



Record views


Files downloads