Temporal matching in link stream: kernel and approximation - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Temporal matching in link stream: kernel and approximation

Abstract

A link stream is a sequence of pairs of the form (t, {u, v}), where t ∈ N represents a time instant and u = v. Given an integer γ, the γ-edge between vertices u and v, starting at time t, is the set of temporally consecutive edges defined as {(t , {u, v}) | t ∈ t, t + γ − 1}. We introduce the notion of temporal matching of a link stream to be a set of pairwise non overlapping γ-edges belonging to the link stream. Unexpectedly, the problem of computing a temporal matching of maximum size turns out to be N P-hard. We provide a kernelization algorithm parameterized by the solution size for the problem. As a byproduct we also depict a 2-approximation algorithm.
Fichier principal
Vignette du fichier
temporalMatchingCTW18.pdf (326.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02075831 , version 1 (21-03-2019)

Identifiers

  • HAL Id : hal-02075831 , version 1

Cite

Julien Baste, Binh-Minh Bui-Xuan. Temporal matching in link stream: kernel and approximation. CTW 2018 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France. ⟨hal-02075831⟩
149 View
65 Download

Share

Gmail Facebook X LinkedIn More