Restricted types of matchings | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Restricted types of matchings

By Dieter Rautenbach

Appears in collections : IX Latin and American algorithms, graphs and optimization symposium (LAGOS 2017) / 9e symposium latino et americain des algorithmes, graphes et de l'optimisation (LAGOS 2017), Exposés de recherche

We present new results concerning restricted types of matchings such as uniquely restricted matchings and acyclic matchings, and we also consider the corresponding edge coloring notions. Our focus lies on bounds, exact and approximative algorithms. Furthermore, we discuss some matching removal problems. The talk is based on joined work with J. Baste, C. Lima, L. Penso, I. Sau, U. Souza, and J. Szwarcfiter.

Information about the video

Date of recording 14/09/2017
Date of publication 14/09/2017
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.19220203
Cite this video Rautenbach, Dieter (14/09/2017). Restricted types of matchings. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19220203
URL https://dx.doi.org/10.24350/CIRM.V.19220203

Domain(s)

Bibliography

Baste, J., & Rautenbach, D. (2017). Degenerate matchings and edge colorings. <arXiv:1702.02358> - https://arxiv.org/abs/1702.02358
Baste, J., Rautenbach, D., & Sau, I. (2016). Uniquely restricted matchings and edge colorings. <arXiv:1611.06815> - https://arxiv.org/abs/1611.06815

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2025

Give feedback