Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897545
DOI10.1007/11604686zbMath1171.05427MaRDI QIDQ5897545
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations, A local characterization of bounded clique-width for line graphs, Characterizations for restricted graphs of NLC-width 2, Well-quasi-order of relabel functions, Line graphs of bounded clique-width, On a disparity between relative cliquewidth and relative NLC-width, Linear layouts measuring neighbourhoods in graphs, Vertex disjoint paths on clique-width bounded graphs