scientific article
From MaRDI portal
Publication:2816011
zbMath1409.05194MaRDI QIDQ2816011
Publication date: 1 July 2016
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305800654?np=y
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Computing a clique tree with the algorithm maximal label search ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph ⋮ Faster parameterized algorithms for \textsc{Minimum Fill-in} ⋮ Finding cut-vertices in the square roots of a graph ⋮ Extremities and orderings defined by generalized graph search algorithms
This page was built for publication:
