Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678): Difference between revisions

@@ Property / cites work @@
+Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
+Normal rank
@@ Property / cites work @@
+Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+A game of cops and robbers
@@ Property / cites work: A game of cops and robbers / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-like \(P_4\)-connected graphs
@@ Property / cites work: Tree-like \(P_4\)-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition and isomorphism of tree-like \(P_4\)-connected graphs
+Normal rank
@@ Property / cites work @@
+On the structure of graphs with few \(P_4\)s
@@ Property / cites work: On the structure of graphs with few \(P_4\)s / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(p\)-connectedness of graphs---a survey
@@ Property / cites work: On the \(p\)-connectedness of graphs---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized aspects of triangle enumeration
@@ Property / cites work: Parameterized aspects of triangle enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Safe separators for treewidth
@@ Property / cites work: Safe separators for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On Computing the Hyperbolicity of Real-World Graphs
+Normal rank
@@ Property / cites work @@
+Into the square: on the complexity of some quadratic-time solvable problems
+Normal rank
@@ Property / cites work @@
+A faster algorithm for betweenness centrality*
@@ Property / cites work: A faster algorithm for betweenness centrality* / rank @@
+Normal rank
@@ Property / cites work @@
+On the hyperbolicity of chordal graphs
@@ Property / cites work: On the hyperbolicity of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Split Decomposition Revisited
@@ Property / cites work: Linear Time Split Decomposition Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Applying clique-decomposition for computing Gromov hyperbolicity
+Normal rank
@@ Property / cites work @@
+On Computing the Gromov Hyperbolicity
@@ Property / cites work: On Computing the Gromov Hyperbolicity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
+Normal rank
@@ Property / cites work @@
+Q4608071
@@ Property / cites work: Q4608071 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+On the model-checking of monadic second-order formulas with edge set quantifications
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of clique-width through nested partitions
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Directed Graphs
@@ Property / cites work: Decomposition of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373681
@@ Property / cites work: Q4373681 / rank @@
+Normal rank
@@ Property / cites work @@
+LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
+Normal rank
@@ Property / cites work @@
+Linear-Time Approximation for Maximum Weight Matching
+Normal rank
@@ Property / cites work @@
+The Parallel Complexity of Coloring Games
@@ Property / cites work: The Parallel Complexity of Coloring Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091021
@@ Property / cites work: Q5091021 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5090996
@@ Property / cites work: Q5090996 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+When can graph hyperbolicity be computed in linear time?
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
+Normal rank
@@ Property / cites work @@
+Clique-width III
@@ Property / cites work: Clique-width III / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
+Normal rank
@@ Property / cites work @@
+BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
+Normal rank
@@ Property / cites work @@
+An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
+Normal rank
@@ Property / cites work @@
+Computing the Gromov hyperbolicity of a discrete metric space
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of \(O(n^ 2)\) problems in computational geometry
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
+Normal rank
@@ Property / cites work @@
+Distance labeling scheme and split decomposition
@@ Property / cites work: Distance labeling scheme and split decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Q3836509
@@ Property / cites work: Q3836509 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
+Normal rank
@@ Property / cites work @@
+Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772406
@@ Property / cites work: Q3772406 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+On metric properties of certain clique graphs
@@ Property / cites work: On metric properties of certain clique graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Graph Distances Parameterized by Treewidth and Diameter
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
+Normal rank
@@ Property / cites work @@
+P-Components and the Homogeneous Decomposition of Graphs
+Normal rank
@@ Property / cites work @@
+Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)
+Normal rank
@@ Property / cites work @@
+Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+The Power of Linear-Time Data Reduction for Maximum Matching
+Normal rank
@@ Property / cites work @@
+Weak bipolarizable graphs
@@ Property / cites work: Weak bipolarizable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Topology manipulations for speeding betweenness centrality computation
+Normal rank
@@ Property / cites work @@
+Upper Bounds on Boolean-Width with Applications to Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Clique-width of graphs defined by one-vertex extensions
+Normal rank
@@ Property / cites work @@
+Solving some NP-complete problems using split decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms for the diameter and radius of sparse graphs
+Normal rank
@@ Property / cites work @@
+Q3197842
@@ Property / cites work: Q3197842 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs indecomposable with respect to the X-join
@@ Property / cites work: Graphs indecomposable with respect to the X-join / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank
@@ Property / cites work @@
+An O(\(n\)) time algorithm for maximum matching on cographs
+Normal rank