Pages that link to "Item:Q5897543"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897543):
Displaying 46 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Block-graph width (Q534563) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Testing branch-width (Q875941) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- (Q5075752) (← links)
- The Rank-Width of the Square Grid (Q5302058) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Prime vertex-minors of a prime graph (Q6201871) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
