Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
Solving Matching Problems Efficiently in Bipartite Graphs
Selma Djelloul

31 January 2015, 14h30 - 31 January 2015, 15h30
Salle/Bat : 475/PCRI-N
Contact :

Activités de recherche : Théorie des graphes

Résumé :
We investigate the problem maxDMM of computing a largest set
of pairwise disjoint maximum matchings in undirected graphs
We solve maxDMM for bipartite graphs, by providing
an $O(n^{1.5}sqrt{m/log n} + mnlog n)$-time algorithm, where
$n$, $m$ denote respectively the number of vertices and the number of edges.
Bisplit graphs are bipartite graphs with the nested neighborhood property.
For bisplit graphs,
(1) we solve maxDMM in time $O(mnlog n)$, and
(2) we design an $O(n^2log n)$-time algorithm to count all
maximum matchings. This latter time is the same time in which runs the best
known algorithm computing the number of maximum matchings in
bisplit graphs but we claim that our algorithm is much simpler.
The key idea underlying both results is that bisplit graphs have
an $O(n)$-time enumeration of their minimal vertex covers.

Pour en savoir plus :
Séminaires
Heterogeneous Treatment Effects Estimation: When M
Raisonnement automatique
Thursday 02 June 2022 - 10h30
Salle : 2011 - DIG-Moulon
Naoufal Acharki .............................................

Witness Generation for JSON Schema
Langages et systèmes centrés données
Monday 30 May 2022 - 00h00
Salle : 455 - PCRI-N
Mohamed-Amine BAAZIZI .............................................

TUTORIAL CODALAB - Apprenez à organiser un challen
Wednesday 13 April 2022 - 00h00
Salle : 1 - DIG-Moulon
Adrien Pavao .............................................

Generative Neural Networks for Observational Causa
Raisonnement automatique
Thursday 07 April 2022 - 10h30
Salle : 2011 - DIG-Moulon
Diviyan Kalainathan .............................................

Datamining in Epi- and Phylogenetics
Tuesday 15 March 2022 - 11h00
Salle : 455 - PCRI-N
Thomas Haschka .............................................