Now showing items 71-72 of 72
Coloração de Arestas em Grafos Split-Comparabilidade
(Universidade Federal de São Carlos, 2017-05-02)
Let G = (V, E) be a simple and undirected graph. An edge-coloring is an assignment of colors to the edges of the graph such that any two adjacent edges receive different colors. The chromatic index of a graph G is the ...
OrchFlow: uma arquitetura para orquestração de redes OpenFlow com múltiplos controladores
(Universidade Federal de São Carlos, 2017-02-23)
Since the emergence of the Software-Defined Networking (SDN), and, more precisely, since the development of an open interface in 2008 called OpenFlow protocol, it is being observed that this new networking paradigm is ...