scientific article; zbMATH DE number 7378700

DOI10.4230/LIPIcs.ESA.2018.30MaRDI QIDQ5009589

Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1709.09737

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parameterized complexityminimal separatorsmim-width\(H\)-topological intersection graphsBoolean-width

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (9)

Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs ⋮ On the tractability of optimization problems on \(H\)-graphs ⋮ Reducing the domination number of graphs via edge contractions and vertex deletions ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Unnamed Item ⋮ Mim-width. II. The feedback vertex set problem ⋮ Distance Domination in Graphs ⋮ Mim-width. III. Graph powers and generalized distance domination problems ⋮ Node multiway cut and subset feedback vertex set on graphs of bounded mim-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Graph classes with structured neighborhoods and algorithmic applications
• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
• Boolean-width of graphs
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• On the parameterized complexity of multiple-interval graph problems
• Precoloring extension. I: Interval graphs
• Combinatorial problems on \(H\)-graphs
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• Algorithmic graph theory and perfect graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• Large Induced Subgraphs via Triangulations and CMSO
• Graph Classes with Structured Neighborhoods and Algorithmic Applications
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• Parameterized Algorithms
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• On \(H\)-topological intersection graphs

This page was built for publication: