research
∙
03/29/2019
Connected max cut is polynomial for graphs without K_5 e as a minor
Given a graph G=(V, E), a connected cut δ (U) is the set of edges of E l...
research
∙
03/18/2019
The facets of the spanning trees polytope
Let G=(V, E) be an undirected graph. The spanning trees polytope P(G) is...
research
∙
02/25/2018
On the Broadcast Routing Problem in Computer Networks
Given an undirected graph G = (V, E), and a vertex r∈ V, an r-acyclic or...
research
∙
02/25/2018
On the Broadcast Routing Problem
Given an undirected graph G = (V, E), and a vertex r∈ V, an r-acyclic or...
research
∙
09/29/2017