Cargando...
Edge-Disjoint Branchings in Temporal Graphs
A temporal digraph [Formula: see text] is a triple [Formula: see text] where G is a digraph, [Formula: see text] is a function on V(G) that tells us the time stamps when a vertex is active, and [Formula: see text] is a function on E(G) that tells for each [Formula: see text] when u and v are linked....
Gardado en:
| Publicado en: | Combinatorial Algorithms |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
2020
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254906/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_9 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|