Temporal matching on geometric graph data

DOI10.1007/978-3-030-75242-2_28MaRDI QIDQ2692739zbMATH OpenOpenAlexFDO

Authors Timothe Picavet, Ngoc-Trung Nguyen, 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

zbMATH Keywords

geometric graphPTAStemporal matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
• Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
• Computing maximum matchings in temporal graphs.
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connection Scan Algorithm
• Connectivity and inference problems for temporal networks
• Expressivity of Time-Varying Graphs
• Graph minors. I. Excluding a forest
• On the advice complexity of online bipartite matching and online stable marriage
• On the complexity of time-dependent shortest paths
• On the power of advice and randomization for online bipartite matching
• Paths, Trees, and Flowers
• Random Geometric Graphs
• Strong bounds for evolution in networks
• Temporal matching
• Temporal vertex cover with a sliding time window
• Topics in Intersection Graph Theory
• Two-sided online bipartite matching and vertex cover: beating the greedy algorithm

Cited in

(3)

• A faster parameterized algorithm for temporal matching
• Two approaches to building time-windowed geometric data structures
• Computing maximum matchings in temporal graphs

This page was built for publication: Temporal matching on geometric graph data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692739)