NobleBlocks
Public

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth

Published in SIAM Journal on Discrete Mathematics • Feb 10, 2022
NobleIDNI0P45W44R79S29
Authors:
Mamadou Moustapha Kanté
,
Christophe Paul
,
Dimitrios M. Thilikos

Abstract

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, where we are given a system of tunnels (represented by a graph) that is contaminated by some infectious substance and we ...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!