Edge-Disjoint Branchings in Temporal Graphs

DOI10.1007/978-3-030-48966-3_9OpenAlexW3032809184MaRDI QIDQ5041184

No author found.

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_9

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Mengerian temporal graphs revisited ⋮ Edge-disjoint branchings in temporal digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• A good algorithm for edge-disjoint branching
• On two minimax theorems in graph
• Edge-disjoint branching in directed multigraphs
• Enumerating maximal cliques in link streams with durations
• Temporal network optimization subject to connectivity constraints
• Temporal flows in temporal networks
• Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
• On edge-disjoint branchings
• Integral decomposition in polyhedra
• The complexity of satisfiability problems
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks

This page was built for publication: Edge-Disjoint Branchings in Temporal Graphs