Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Caminhos disjuntos"”.
-
Conexão de terminais com limitação de roteadores: complexidade e relação com fluxos e caminhos disjuntos
A connection tree of a graph G for a non-empty subset W ⊆ V (G) is a tree subgraph of G such that W ⊆ V (T) and every leaf of T belongs to W. The vertices in W are called terminals, the vertices in V (T) \ W with degree 2 in T are called linkers and the vertices in V (T) \ W with degree at least 3 …