Computing Maximum Matchings in Temporal Graphs

@inproceedings{Mertzios2020ComputingMM,
  title={Computing Maximum Matchings in Temporal Graphs},
  author={George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Viktor Zamaraev and Philipp Zschoche},
  booktitle={STACS},
  year={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 extension of the classical graph problem Maximum Matching, taking into account the dynamic nature of temporal graphs. In our problem, Maximum Temporal Matching… Expand
Maximum 0-1 Timed Matching on Temporal Graphs
TLDR
This paper defines a type of matching called 0-1 timed matching for temporal graphs, and investigates the problem of finding a {\em maximum 0- 1 timed matching} for different classes of temporal graphs. Expand
Temporal Vertex Cover with a Sliding Time Window
TLDR
This paper introduces and study two natural temporal extensions of the classical problem VERTEX COVER, and presents a thorough investigation of the computational complexity and approximability of these two temporal covering problems. Expand
The Complexity of Transitively Orienting Temporal Graphs
TLDR
The fundamental notion of a temporal transitive orientation is introduced and the main result is a conceptually simple, yet technically quite involved, polynomial-time algorithm for recognizing whether a given temporal graph G is transitively orientable. Expand
Deleting edges to restrict the size of an epidemic
TLDR
This paper introduces two natural deletion problems for temporal graphs (for deletion of edges and of edge availabilities, respectively) and provides positive and negative results on their computational complexity, both in the traditional and the parameterized sense, subject to various natural parameters. Expand
Deleting edges to restrict the size of an epidemic in temporal networks
TLDR
This paper introduces two natural deletion problems for temporal graphs (for deletion of edges and of edge availabilities, respectively) and provides positive and negative results on their computational complexity, both in the traditional and the parameterized sense, subject to various natural parameters. Expand
Listing All Maximal k-Plexes in Temporal Graphs
TLDR
A recursive algorithm for enumerating all maximal Δ-k-plexes and performs experiments on real-world social networks that demonstrate the practical feasibility of this approach and observe that the algorithm is on average significantly faster than the previous algorithms by Himmel et al. Expand
Multistage Problems on a Global Budget
TLDR
This work studies the different (time) layers of a temporal graph, and finds that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problemssuch as Matching. Expand
Temporal Graphs: Structure, Algorithms, Applications
This report documents the program and the outcomes of Dagstuhl Seminar 121171 “Temporal Graphs: Structure, Algorithms, Applications”. The seminar was organized around four core areas: models,Expand
Internship LIP 6 SU UPMC Temporal matching on geometric graphs
  • 2021
Historical graph data is the new trend of our generation of social networking digital life. It is not only important for CRM management, BI consulting, data science, and so on, but it is also at theExpand
Comparing temporal graphs using dynamic time warping
TLDR
This work defines the dynamic temporal graph warping (dtgw) distance to determine the dissimilarity of two temporal graphs and develops a quadratic programming formulation and an efficient heuristic. Expand
...
1
2
...

References

SHOWING 1-10 OF 80 REFERENCES
Temporal Vertex Cover with a Sliding Time Window
TLDR
This paper introduces and study two natural temporal extensions of the classical problem VERTEX COVER, and presents a thorough investigation of the computational complexity and approximability of these two temporal covering problems. Expand
How fast can we reach a target vertex in stochastic temporal graphs?
TLDR
This paper investigates the complexity of two naturally related, but fundamentally different, temporal path (journey) problems: MINIMUM ARRIVAL and BEST POLICY and investigates the computational landscape of both problems for the different values of memory $k. Expand
Temporal Network Optimization Subject to Connectivity Constraints
TLDR
This work gives two efficient algorithms for computing shortest time-respecting paths on a temporal network, and proves that there is a natural analogue of Menger’s theorem holding for arbitrary temporal networks. Expand
On Temporal Graph Exploration
TLDR
The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time, and this work provides an explicit construction of temporal graphs that require \(\Theta (n^2) steps to be explored. Expand
Traveling salesman problems in temporal graphs
TLDR
It is proved that, it cannot be approximated within cn, for some constant c > 0 , in a special case of temporal graphs and within ( 2 − e ) , for every constant e > 0, in another special case in which D ( t ) is strongly connected for all 1 ≤ t ≤ l , both unless P = NP . Expand
Sliding Window Temporal Graph Coloring
TLDR
A thorough investigation of the computational complexity of this temporal coloring problem is presented, and strong computational hardness results are proved, complemented by efficient exact and approximation algorithms. Expand
Temporal Matching
TLDR
It is shown that finding temporal matchings is a sensitive question when mining data from such a perspective as: managing peer-working when any pair of peers are to collaborate over a period of one month, at an average rate of at least two email exchanges every week. Expand
Temporal vertex cover with a sliding time window
TLDR
This paper introduces and study two natural temporal extensions of the classical problem VERTEX COVER and presents a thorough investigation of the computational complexity and approximability of these two temporal covering problems. Expand
The Complexity of Finding Small Separators in Temporal Graphs
TLDR
It is proved that the non-strict variant is fixed-parameter tractable when parameterized by the size of the temporal core, while the strict variant remains NP-complete, even for constant-size temporal cores. Expand
Flooding Time of Edge-Markovian Evolving Graphs
TLDR
An interesting consequence of the results is that information spreading can be fast even if the graph, at every time step, is very sparse and disconnected. Expand
...
1
2
3
4
5
...