Temporal matching on geometric graph data
From MaRDI portal
Publication:2692739
DOI10.1007/978-3-030-75242-2_28OpenAlexW3157721496MaRDI QIDQ2692739
Ngoc-Trung Nguyen, Timothe Picavet, Binh-Minh Bui-Xuan
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_28
Related Items (2)
Computing maximum matchings in temporal graphs ⋮ A faster parameterized algorithm for temporal matching
Cites Work
- Unnamed Item
- On the advice complexity of online bipartite matching and online stable marriage
- On the complexity of time-dependent shortest paths
- Graph minors. I. Excluding a forest
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Strong bounds for evolution in networks
- Temporal vertex cover with a sliding time window
- Temporal matching
- On temporal graph exploration
- Expressivity of Time-Varying Graphs
- Algorithmic Applications of Baur-Strassen’s Theorem
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- Topics in Intersection Graph Theory
- Random Geometric Graphs
- Connection Scan Algorithm
- Paths, Trees, and Flowers
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Computing maximum matchings in temporal graphs.
- Connectivity and inference problems for temporal networks
This page was built for publication: Temporal matching on geometric graph data
