Computing Maximum Matchings in Temporal Graphs
Leibniz International Proceedings in Informatics, 2020.
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph G, a temporal graph is represented by assigning a set of integer time-labels to every edge e of G, indicating the discrete time steps at which e is active. We introduce and study the complexity of a natural temporal extensio...More
PPT (Upload PPT)