23 citations · 76 across the 30 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020
A linear fixed parameter tractable algorithm for connected pathwidth
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
The graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in terms of node search wh…
cs.DS2020
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph
Guillaume Mescoff, Christophe Paul, Dimitrios Thilikos
It is well known that the treewidth of a graph corresponds to the node search number where a team of cops is pursuing a robber that is lazy, visible and has the ability to move…