Graph-Theoretic Concepts in Computer Science
From MaRDI portal
(Redirected from Publication:5897543)
Graph-Theoretic Concepts in Computer Science (scientific article; zbMATH DE number 5069341)
Graph-Theoretic Concepts in Computer Science (scientific article; zbMATH DE number 5069341)
Recommendations
Cited in
(56)- From a zoo to a zoology: Towards a general theory of graph polynomials
- Graph operations characterizing rank-width
- Query efficient implementation of graphs of bounded clique-width
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Constrained-path labellings on graphs of bounded clique-width
- Alliances in graphs of bounded clique-width
- Linear rank-width and linear clique-width of trees
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- From tree-decompositions to clique-width terms
- Branch decomposition heuristics for linear matroids
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Vertex-minor reductions can simulate edge contractions
- Line graphs of bounded clique-width
- Hypertree width and related hypergraph invariants
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- Bounding the clique-width of H-free chordal graphs
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
- Connection Matrices for MSOL-Definable Structural Invariants
- Better polynomial algorithms on graphs of bounded rank-width
- Boolean-width of graphs
- On the structure of (pan, even hole)-free graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On the parameterized complexity of computing balanced partitions in graphs
- Approximating rank-width and clique-width quickly
- More applications of the d-neighbor equivalence: connectivity and acyclicity constraints
- The behavior of clique-width under graph operations and graph transformations
- The Rank-Width of the Square Grid
- Block-graph width
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Prime vertex-minors of a prime graph
- The enumeration of vertex induced subgraphs with respect to the number of components
- Vertex-minors of graphs: a survey
- Succinct data structures for bounded clique-width graphs
- Slim tree-cut width
- Minimal classes of graphs of unbounded clique-width
- Slim tree-cut width
- The fine-grained complexity of graph homomorphism parameterized by clique-width
- Boolean-width of graphs
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Unavoidable vertex-minors in large prime graphs
- Trees, grids, and MSO decidability: from graphs to matroids
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Testing branch-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Linear delay enumeration and monadic second-order logic
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Computing rank-width exactly
This page was built for publication: Graph-Theoretic Concepts in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897543)
