Brahim Chaourar

activity

20172025

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2019

Connected max cut is polynomial for graphs without $K_{5} \ e$ as a minor

Brahim Chaourar

Given a graph $G = (V, E)$ , a connected cut $δ (U)$ is the set of edges of E linking all vertices of U to all vertices of $V \ U$ such that the induced subgraphs $G [U]$ and $G…

cs.DS2018

On the Broadcast Routing Problem in Computer Networks

Brahim Chaourar

Given an undirected graph $G = (V, E)$ , and a vertex $r \in V$ , an $r$ -acyclic orientation of $G$ is an orientation $O E$ of the edges of $G$ such that the digraph $O G = (V, O E)$ is…

Connected max cut is polynomial for graphs without K5​\e as a minor

On the Broadcast Routing Problem in Computer Networks

Connected max cut is polynomial for graphs without $K_{5} \ e$ as a minor