LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901632
DOI10.1007/b95852zbMath1196.68173OpenAlexW2475444492MaRDI QIDQ5901632
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations, Inductive computations on graphs defined by clique-width expressions, Characterizations for restricted graphs of NLC-width 2, Stability, vertex stability, and unfrozenness for special graph classes, Line graphs of bounded clique-width, The monadic second-order logic of graphs. XV: On a conjecture by D. Seese, Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
