Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087): Difference between revisions

Revision as of 16:04, 15 July 2024

scientific article; zbMATH DE number 6339257

Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques

Language	Label	Description	Also known as
English	Algorithms parameterized by vertex cover and modular width, through potential maximal cliques	scientific article; zbMATH DE number 6339257	Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques

Statements

instance of

scholarly article

0 references

title

Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (English)

0 references

Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English)

0 references

0 references

0 references

0 references

0 references

0 references

Algorithm Theory – SWAT 2014

0 references

publication date

23 May 2018

0 references

2 September 2014

0 references

full work available at URL

https://arxiv.org/abs/1404.3882

0 references

zbMATH Keywords

parametrized algorithms

0 references

potential maximal cliques

0 references

treewidth

0 references

vertex cover

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Easy problems for tree-decomposable graphs

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

Tree decompositions with small cost

0 references

Computing the treewidth and the minimum fill-in with the modular decomposition

0 references

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

0 references

Listing all potential maximal cliques of a graph

0 references

Treewidth and Pathwidth Parameterized by the Vertex Cover Number

0 references

Improved upper bounds for vertex cover

0 references

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

0 references

Q3077955

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

On cutwidth parameterized by vertex cover

0 references

On the vertex ranking problem for trapezoid, circular-arc and other graphs

0 references

Graph Layout Problems Parameterized by Vertex Cover

0 references

Computing tree-depth faster than \(2^n\)

0 references

Exact Algorithms for Treewidth and Minimum Fill-In

0 references

Algorithms parameterized by vertex cover and modular width, through potential maximal cliques

0 references

Large Induced Subgraphs via Triangulations and CMSO

0 references

Finding Induced Subgraphs via Minimal Triangulations

0 references

Treewidth computation and extremal combinatorics

0 references

The complexity of first-order and monadic second-order logic revisited

0 references

Parameterized Algorithms for Modular-Width

0 references

Minimal Triangulation Algorithms for Perfect Phylogeny Problems

0 references

Algorithmic meta-theorems for restrictions of treewidth

0 references

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

0 references

On the complexity of computing treelength

0 references

Sparsity. Graphs, structures, and algorithms

0 references

A Faster Parameterized Algorithm for Treedepth

0 references

Q4944975

0 references

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

0 references

Identifiers

zbMATH Open document ID

1390.68344

0 references

1386.68068

0 references

DOI

10.1007/s00453-017-0297-1

0 references

10.1007/978-3-319-08404-6_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1751087

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Tree decompositions with small cost
@@ Property / cites work: Tree decompositions with small cost / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the treewidth and the minimum fill-in with the modular decomposition
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth Parameterized by the Vertex Cover Number
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+On cutwidth parameterized by vertex cover
@@ Property / cites work: On cutwidth parameterized by vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex ranking problem for trapezoid, circular-arc and other graphs
+Normal rank
@@ Property / cites work @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Computing tree-depth faster than \(2^n\)
@@ Property / cites work: Computing tree-depth faster than \(2^n\) / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+Treewidth computation and extremal combinatorics
@@ Property / cites work: Treewidth computation and extremal combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Triangulation Algorithms for Perfect Phylogeny Problems
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
+Normal rank
@@ Property / cites work @@
+On the complexity of computing treelength
@@ Property / cites work: On the complexity of computing treelength / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Parameterized Algorithm for Treedepth
@@ Property / cites work: A Faster Parameterized Algorithm for Treedepth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944975
@@ Property / cites work: Q4944975 / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank