Tata Institute of Fundamental Research
Deterministic Representation of Linear Matroids
STCS Seminar
Speaker:
Pranabendu Misra (Max Planck Institute for Informatics
Saarbrucken, Germany.)
Organiser:
Ramprasad Saptharishi
Date:
Tuesday, 21 Jan 2020, 14:30 to 15:30
Venue:
A-201 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
Abstract: Matroids are combinatorial objects that generalize the notion of linear independence. They have several applications in design and analysis of algorithms. Linear matroids are a subclass of matroids that can be represented by a matrix. Recently, these matroids have found applications in Parameterized Complexity, including some breakthrough results. In this talk, we will discuss the problem of constructing a matrix representation of linear matroids, especially via deterministic algorithms.
| Speaker: | Pranabendu Misra (Max Planck Institute for Informatics Saarbrucken, Germany.) |
| Organiser: | Ramprasad Saptharishi |
| Date: | Tuesday, 21 Jan 2020, 14:30 to 15:30 |
| Venue: | A-201 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
Abstract: Matroids are combinatorial objects that generalize the notion of linear independence. They have several applications in design and analysis of algorithms. Linear matroids are a subclass of matroids that can be represented by a matrix. Recently, these matroids have found applications in Parameterized Complexity, including some breakthrough results. In this talk, we will discuss the problem of constructing a matrix representation of linear matroids, especially via deterministic algorithms.