0-1 timed matching in bipartite temporal graphs

DOI10.1007/978-3-030-39219-2_27zbMath1453.68141OpenAlexW3002689241MaRDI QIDQ779227

Subhrangsu Mandal, Arobinda Gupta

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_27

zbMATH Keywords

temporal matching0-1 timed matchingtemporal graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (2)

Maximum 0-1 timed matching on temporal graphs ⋮ Locally defined independence systems on graphs

This page was built for publication: 0-1 timed matching in bipartite temporal graphs