Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897573
DOI10.1007/11604686zbMath1171.68496MaRDI QIDQ5897573
Rolf Niedermeier, Jiong Guo, Falk Hüffner, Michael Dom
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Pairwise Compatibility Graphs: A Survey, Towards a characterization of leaf powers by clique arrangements, Polynomial kernels for 3-leaf power graph modification problems, Recognition of linear and star variants of leaf powers is in P, Recognizing k -Leaf Powers in Polynomial Time, for Constant k, The Clique-Width of Tree-Power and Leaf-Power Graphs, The 3-Steiner Root Problem, A survey of parameterized algorithms and the complexity of edge modification, Parameterized Leaf Power Recognition via Embedding into Graph Products, Rooted directed path graphs are leaf powers, Characterising \((k,\ell )\)-leaf powers, A more effective linear kernelization for cluster editing, The NLC-width and clique-width for powers of graphs of bounded tree-width, Parameterized leaf power recognition via embedding into graph products