Linear time split decomposition revisited
From MaRDI portal
Recommendations
- An O(n2) Algorithm for Undirected Split Decomposition
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Prime Testing for the Split Decomposition of a Graph
- Practical and efficient split decomposition via graph-labelled trees
- scientific article; zbMATH DE number 1456953
Cited in
(18)- Solving problems on graphs of high rank-width
- On complexities of minus domination
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Efficient split algorithms for continuous-time and discrete-time systems
- Detecting 2-joins faster
- On polygon numbers of circle graphs and distance hereditary graphs
- On computing the Gromov hyperbolicity
- Between treewidth and clique-width
- Between treewidth and clique-width
- An O(n2) Algorithm for Undirected Split Decomposition
- Practical and efficient split decomposition via graph-labelled trees
- Computing \(H\)-joins with application to 2-modular decomposition
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- The \(b\)-matching problem in distance-hereditary graphs and beyond
- Vertex-minors of graphs: a survey
- Hypergraphs with polynomial representation: introducing \(r\)-splits
- A note on distance-hereditary graphs whose complement is also distance-hereditary
- Meta-kernelization with structural parameters
This page was built for publication: Linear time split decomposition revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910928)
