Bounded persistence pathwidth

Rodney G. Downey, Catherine McCartin · 2005

The role of graph width metrics, such as treewidth, pathwidth, and cliquewidth, is now seen as central in both algorithm design and the delineation of what is algorithmically possible. In this article we introduce a new, related, parameter for graphs, persistence.

Read the paper · More papers on PaperTik