Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
type: Item
instance of: scholarly article
title: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
title: Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
zbMATH Open document ID: 1390.68344
zbMATH Open document ID: 1386.68068
DOI: 10.1007/978-3-319-08404-6_16
DOI: 10.1007/S00453-017-0297-1
author: Fedor V. Fomin
author: Mathieu Liedloff
author: Pedro Montealegre
author: Ioan Todinca
published in: Algorithmica
published in: Algorithm Theory – SWAT 2014
publication date: 2018-05-23T00:00:00Z
publication date: 2014-09-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1404.3882
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6872022
zbMATH DE Number: 6339257
zbMATH Keywords: parametrized algorithms
zbMATH Keywords: potential maximal cliques
zbMATH Keywords: treewidth
zbMATH Keywords: vertex cover
MaRDI profile type: Publication
OpenAlex ID: W3022919855
OpenAlex ID: W26903954
arXiv ID: 1404.3882
Wikidata QID: Q60488399
cites work: Easy problems for tree-decomposable graphs
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Tree decompositions with small cost
cites work: Computing the treewidth and the minimum fill-in with the modular decomposition
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: Treewidth and Pathwidth Parameterized by the Vertex Cover Number
cites work: Improved upper bounds for vertex cover
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q3077955
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: On cutwidth parameterized by vertex cover
cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs
cites work: Graph Layout Problems Parameterized by Vertex Cover
cites work: Computing tree-depth faster than \(2^n\)
cites work: Exact Algorithms for Treewidth and Minimum Fill-In
cites work: Large Induced Subgraphs via Triangulations and CMSO
cites work: Finding Induced Subgraphs via Minimal Triangulations
cites work: Treewidth computation and extremal combinatorics
cites work: The complexity of first-order and monadic second-order logic revisited
cites work: Parameterized Algorithms for Modular-Width
cites work: Minimal Triangulation Algorithms for Perfect Phylogeny Problems
cites work: Algorithmic meta-theorems for restrictions of treewidth
cites work: Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
cites work: On the complexity of computing treelength
cites work: Sparsity. Graphs, structures, and algorithms
cites work: A Faster Parameterized Algorithm for Treedepth
cites work: Q4944975
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
DBLP publication ID: conf/swat/FominLMT14
description: scientific article; zbMATH DE number 6339257
alternative label: Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques