0-1 timed matching in bipartite temporal graphs

DOI10.1007/978-3-030-39219-2_27MaRDI QIDQ779227zbMATH OpenOpenAlexFDO

Authors 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

0-1 timed matchingtemporal graphtemporal matching

Mathematics Subject Classification ID

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) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Maximum 0-1 timed matching on temporal graphs
• Temporal matching
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• Temporal vertex cover with a sliding time window

Cited in

(5)

• Locally defined independence systems on graphs
• Maximum 0-1 timed matching on temporal graphs
• Temporal matching
• Computing maximum matchings in temporal graphs.
• Computing maximum matchings in temporal graphs

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

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