Mengerian temporal graphs revisited

DOI10.1007/978-3-030-86593-1_21OpenAlexW3201570881MaRDI QIDQ2140509

Yanyan Li

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_21

zbMATH Keywords

forbidden minorsMenger's theoremtemporal graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Mengerian graphs: characterization and recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating maximal cliques in link streams with durations
• Temporal network optimization subject to connectivity constraints
• Finding temporal paths under waiting time constraints
• The complexity of finding small separators in temporal graphs
• Edge-Disjoint Branchings in Temporal Graphs
• Finding topological subgraphs is fixed-parameter tractable
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks
• Temporal graph classes: a view through temporal separators

This page was built for publication: Mengerian temporal graphs revisited