Temporal Matching

12/20/2018
by   Julien Baste, et al.
0

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 by {(t',{u,v}) | t' ∈ [t,t+γ-1]}. We introduce the notion of temporal matching of a link stream to be an independent γ-edge set belonging to the link stream. Unexpectedly, the problem of computing a temporal matching of maximum size turns out to be NP-difficult. We show a kernelization algorithm parameterized by the solution size for the problem. As a byproduct we also depict a 2-approximation algorithm. Both our 2-approximation and kernelization algorithms are implemented and confronted to link streams collected from real world graph data. We observe that finding temporal matchings is non trivial when sampling our data from such a perspective as: managing peer-working when any pair of peers X and Y are to collaborate over a period of one month, at an average rate of at least two exchanges every week. We furthermore design a link stream generating process by mimicking the behaviour of a random moving group of particles under natural simulation, and confront our algorithms to these generated instances of link streams. On tangent areas of our sampling method, the kernelization algorithm leads to an upper bound which nearly meets the lower bound given by the temporal matching computed by the 2-approximation algorithm. All the implementations are open source.

READ FULL TEXT

page 17

page 18

research
05/01/2020

Improved Bound for Matching in Random-Order Streams

We study the problem of computing an approximate maximum cardinality mat...
research
12/16/2020

Maximum 0-1 Timed Matching on Temporal Graphs

Temporal graphs are graphs where the topology and/or other properties of...
research
10/20/2020

A Faster Parameterized Algorithm for Temporal Matching

A temporal graph is a sequence of graphs (called layers) over the same v...
research
07/03/2019

On computing distances and latencies in Link Streams

Link Streams were proposed a few years ago as a model of temporal networ...
research
06/27/2022

Beating Greedy Matching in Sublinear Time

We study sublinear time algorithms for estimating the size of maximum ma...
research
12/28/2022

Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability

In this work, we study the Induced Matching problem: Given an undirected...
research
02/14/2022

Enhancing expressivity of checked corecursive streams (extended version)

We propose a novel approach to stream definition and manipulation. Our s...

Please sign up or login with your details

Forgot password? Click here to reset