Computing maximum matchings in temporal graphs

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 c...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 137; pp. 1 - 19
Main Authors:	Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor, Zschoche, Philipp
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2023
Subjects:	Approximation algorithms APX-hardness Fixed-Parameter tractability Independent set Kernelization Link streams NP-hardness Temporal line graphs Link streams NP-hardness Temporal line graphs Fixed-Parameter tractability Approximation algorithms Independent set APX-hardness Kernelization
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!