Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897543
DOI10.1007/11604686zbMath1126.05304MaRDI QIDQ5897543
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (43)
Trees, grids, and MSO decidability: from graphs to matroids ⋮ Polynomial algorithms for protein similarity search for restricted mRNA structures ⋮ The Rank-Width of the Square Grid ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ Testing branch-width ⋮ An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion ⋮ MSOL partitioning problems on graphs of bounded treewidth and clique-width ⋮ From tree-decompositions to clique-width terms ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ A SAT Approach to Clique-Width ⋮ Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ Graph Operations Characterizing Rank-Width and Balanced Graph Expressions ⋮ Prime vertex-minors of a prime graph ⋮ On the structure of (pan, even hole)‐free graphs ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Constrained-path labellings on graphs of bounded clique-width ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Branch decomposition heuristics for linear matroids ⋮ Faster algorithms for vertex partitioning problems parameterized by clique-width ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Minimal classes of graphs of unbounded clique-width ⋮ Vertex-minor reductions can simulate edge contractions ⋮ Line graphs of bounded clique-width ⋮ Hypertree width and related hypergraph invariants ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Block-graph width ⋮ Linear delay enumeration and monadic second-order logic ⋮ \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth ⋮ Unnamed Item ⋮ Branch-width, parse trees, and monadic second-order logic for matroids. ⋮ Boolean-width of graphs ⋮ Connection Matrices for MSOL-Definable Structural Invariants ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ Alliances in graphs of bounded clique-width ⋮ Unavoidable vertex-minors in large prime graphs ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Boolean-Width of Graphs ⋮ Rank-width and vertex-minors ⋮ Node multiway cut and subset feedback vertex set on graphs of bounded mim-width ⋮ Linear rank-width and linear clique-width of trees
This page was built for publication: Graph-Theoretic Concepts in Computer Science
