Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Espada, Joaquim"'
Let G = (V, E) be a directed and weighted graph with vertex set V of size n and edge set E of size m, such that each edge (u, v) \in E has a real-valued weight w(u, c). An arborescence in G is a subgraph T = (V, E') such that for a vertex u \in V, th
Externí odkaz:
http://arxiv.org/abs/2311.03262
