Graph operations characterizing rank-width
From MaRDI portal
Recommendations
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Rank-width: algorithmic and structural results
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Thread graphs, linear rank-width and their algorithmic applications
- Graph-Theoretic Concepts in Computer Science
Cites work
- scientific article; zbMATH DE number 475615 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Algorithmic uses of the Feferman-Vaught theorem
- Approximating clique-width and branch-width
- Clique-width minimization is NP-hard
- Compact Forbidden-Set Routing
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Finding Branch-Decompositions and Rank-Decompositions
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the Relationship Between Clique-Width and Treewidth
- Parametrized complexity theory.
- Query efficient implementation of graphs of bounded clique-width
- Rank-width and vertex-minors
- Rank‐width is less than or equal to branch‐width
- Recognizability, hypergraph operations, and logical types
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- The recognizability of sets of graphs is a robust property
- The relative clique-width of a graph
- Upper bounds to the clique width of graphs
- Vertex-minor reductions can simulate edge contractions
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(17)- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Thread graphs, linear rank-width and their algorithmic applications
- Monoidal Width: Capturing Rank Width
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- On the approximate compressibility of connected vertex cover
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Automata approach to graphs of bounded rank-width
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- A characterisation of clique-width through nested partitions
- Rank-width: algorithmic and structural results
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Grammars and clique-width bounds from split decompositions
- \(\mathbb F\)-rank-width of (edge-colored) graphs
- Directed rank-width and displit decomposition
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- The rank-width of edge-coloured graphs
This page was built for publication: Graph operations characterizing rank-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028455)
