G. Ducoffe

activity

20172026

most citedA story of diameter, radius and Helly property

6 citations · 13 across the 11 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2018

Polynomial-time Recognition of 4-Steiner Powers

Guillaume Ducoffe

The $k^{t h}$ -power of a given graph $G = (V, E)$ is obtained from $G$ by adding an edge between every two distinct vertices at a distance at most $k$ in $G$ . We call $G$ a $k$ -Steiner…

cs.CC2018

Equivalence between pathbreadth and strong pathbreadth

Guillaume Ducoffe, Arne Leitert

We say that a given graph $G = (V, E)$ has \emph{pathbreadth} at most $ρ$ , denoted $\pb(G) \leq ρ$, if there exists a Roberston and Seymour's path decomposition where every bag is…