Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques

Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Volume 9224 of Lecture Notes in Computer Science, pages 499-512, Springer, 2015. [doi]

Abstract

Abstract is missing.