Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
DOI10.1007/978-3-662-53174-7_35zbMATH Open1417.05222OpenAlexW2486778190MaRDI QIDQ2827832FDOQ2827832
Authors: Mathieu Liedloff, Pedro Montealegre, Ioan Todinca 
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53174-7_35
Recommendations
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- scientific article; zbMATH DE number 1305094
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- Minimum \((n,k,t)\) clique graphs
- scientific article; zbMATH DE number 4134082
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- On the minimum number of \(k\)-cliques in graphs with restricted independence number
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph minors. XX: Wagner's conjecture
- A partial k-arboretum of graphs with bounded treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Large Induced Subgraphs via Triangulations and CMSO
- Listing all potential maximal cliques of a graph
- Treewidth and minimum fill-in: Grouping the minimal separators
- Finding induced subgraphs via minimal triangulations
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Chordal deletion is fixed-parameter tractable
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- The complexity of first-order and monadic second-order logic revisited
- Fixed-parameter tractability of treewidth and pathwidth
- Parameterized complexity of vertex deletion into perfect graph classes
- Independent packings in structured graphs
- Upper bounds on the size of obstructions and intertwines
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
Cited In (3)
This page was built for publication: Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827832)
