# Edge-Disjoint Branchings in Temporal Graphs

@article{Campos2020EdgeDisjointBI,
title={Edge-Disjoint Branchings in Temporal Graphs},
author={Victor A. Campos and Raul Lopes and Andrea Marino and Ana Silva},
journal={Combinatorial Algorithms},
year={2020},
volume={12126},
pages={112 - 125}
}
• Published 28 February 2020
• Materials Science
• Combinatorial Algorithms
A temporal digraph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{G}$$\end{document} is a triple \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt…
4 Citations
• Mathematics
ArXiv
• 2022
A temporal graph is a graph whose edges are available only at speciﬁc times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, i.e. sequence
• Mathematics
SSRN Electronic Journal
• 2022
A temporal graph G is a graph that changes with time. More specif-ically, it is a pair ( G, λ ) where G is a graph and λ is a function on the edges of G that describes when each edge e ∈ E ( G ) is
• Computer Science
IWOCA
• 2020
This paper presents a meta-modelling architecture suitable for large-scale distributed Optimization Via Population Protocols and some examples show how this architecture can be implemented in the rapidly changing environment.

## References

SHOWING 1-10 OF 29 REFERENCES

• Mathematics, Computer Science
CIAC
• 2017
The flow model is new and differs from the “flows over time” model, also called “dynamic flows” in the literature, and it is shown that the problem of finding the maximum amount of flow that can pass from a source vertex to a sink vertex up to a given time is solvable in Polynomial time.
• Computer Science, Mathematics
Algorithmica
• 2018
This work gives two efficient algorithms for computing shortest time-respecting paths on a temporal network, and proves that there is a natural analogue of Menger’s theorem holding for arbitrary temporal networks.
• Mathematics, Computer Science
STOC '00
• 2000
This work defines and studies the class of inference problems, in which it seeks to reconstruct a partially specified time labeling of a network in a manner consistent with an observed history of information flow, and provides results on two types of problems for temporal networks.
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
• Computer Science
Proc. VLDB Endow.
• 2014
The shortcomings of classic shortest path in a temporal graph are shown, various concepts of "shortest" path for temporal graphs are studied, and efficient algorithms to compute these temporal paths are proposed.
An edge-scheduled network N is a multigraph G = (V, E), where each edge e ϵ E has been assigned two real weights: a start time α(e) and a finish time β(e). Such a multigraph models a communication or
This work shows that the edge-disjoint paths problem is W[1]-hard, and it is shown that the problem remains W[ 1]-hard even if the demand graph consists of two sets of parallel edges.
• Computer Science
Int. J. Parallel Emergent Distributed Syst.
• 2012
This paper presents a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature, and examines how TVGs can be used to study the evolution of network properties, and proposes different techniques, depending on whether the indicators for these properties are atemporal or temporal.
• Computer Science
Social Network Analysis and Mining
• 2018
This paper generalizes graph concepts to cope with both intrinsically temporal and structural nature of interactions, and obtains a language to directly deal with interactions over time, similar to the language provided by graphs to deal with relations.
• Computer Science
SIGMOD Conference
• 2015
This work designs efficient approximation algorithms based on a transformation to the Directed Steiner Tree problem (DST) with a better time complexity and the same approximation factor compared to the state-of-the-art algorithm.