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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6339257
@@ Property / title @@
+Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68068
@@ Property / zbMATH Open document ID: 1386.68068 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-08404-6_16
@@ Property / DOI: 10.1007/978-3-319-08404-6_16 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithm Theory – SWAT 2014
@@ Property / published in: Algorithm Theory – SWAT 2014 / rank @@
+Normal rank
@@ Property / publication date @@
+September 2014Timestamp +2014-09-02T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-09-02T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 2 September 2014 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6339257
@@ Property / zbMATH DE Number: 6339257 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W26903954
@@ Property / OpenAlex ID: W26903954 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3882
@@ Property / arXiv ID: 1404.3882 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60488399
@@ Property / Wikidata QID: Q60488399 / rank @@
+Normal rank
@@ 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
@@ Property / DBLP publication ID @@
+conf/swat/FominLMT14
@@ Property / DBLP publication ID: conf/swat/FominLMT14 / rank @@
+Normal rank

Latest revision as of 03:05, 13 November 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