23 citations · 76 across the 30 of their papers we have counts for
Showing 2008 · cs.DMShow all
2 papers · 2 filters
cs.DM2008★ 1 cited
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
Emeric Gioan, Christophe Paul
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the dista…
cs.DM2008
Polynomial kernels for 3-leaf power graph modification problems
Stephane Bessy, Christophe Paul, Anthony Perez
A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edg…