Temporal matching
From MaRDI portal
Publication:2285132
DOI10.1016/j.tcs.2019.03.026zbMath1436.68220arXiv1812.08615OpenAlexW4234281607MaRDI QIDQ2285132
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.08615
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (7)
Multistage graph problems on a global budget ⋮ Maximum 0-1 timed matching on temporal graphs ⋮ Computing maximum matchings in temporal graphs ⋮ Temporal matching on geometric graph data ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ A faster parameterized algorithm for temporal matching
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- On the advice complexity of online bipartite matching and online stable marriage
- Computing maximal cliques in link streams
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Algorithmic Applications of Baur-Strassen’s Theorem
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- Popular Matchings
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
- The Power of Linear-Time Data Reduction for Maximum Matching
- Paths, Trees, and Flowers
- Machine Learning: ECML 2004
- Graph colouring and the probabilistic method
This page was built for publication: Temporal matching
