Solving Matching Problems Efficiently in Bipartite Graphs - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Solving Matching Problems Efficiently in Bipartite Graphs

Selma Djelloul
Fichier non déposé

Dates et versions

hal-01287317 , version 1 (12-03-2016)

Identifiants

Citer

Selma Djelloul. Solving Matching Problems Efficiently in Bipartite Graphs. 25th International Workshop on Combinatorial Algorithms, University of Minnesota - University of Winsconsin, Oct 2014, Duluth, United States. pp.128-139, ⟨10.1007/978-3-319-19315-1_12⟩. ⟨hal-01287317⟩
62 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More