|
|
|
|
|
Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo and Cátia Vaz
Let ??=(??,??)
G
=
(
V
,
E
)
be a directed and weighted graph with a vertex set V of size n and an edge set E of size m such that each edge (??,??)???
(
u
,
v
)
?
E
has a real-valued weight ??(??,??)
w
(
u
,
c
)
. An arborescence in G is a subgraph ??=...
ver más
|
|
|
|
|