Computing Maximum Matchings in Temporal Graphs

Hendrik Molter
Hendrik Molter
Viktor Zamaraev
Viktor Zamaraev
Philipp Zschoche
Philipp Zschoche

Leibniz International Proceedings in Informatics, 2020.

Cited by: 3|Views20
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments