AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of this fact by directly constructing a strong elimination ordering. Our method can be implemented to run in linear time. As an application, we give a new linear algorithm for the minimum weight total dominating set problem for trees
AbstractWe develop a constant time transposition “oracle” for the set of perfect elimination orderin...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
AbstractThe class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass o...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
AbstractThe use of (generalized) tree structure in graphs is one of the main topics in the field of ...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractWe show that for graphs of bounded degree, a minimal elimination ordering can be determined ...
We develop a constant time transposition "oracle" for the set of perfect elimination orderings of ch...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
AbstractWe develop a constant time transposition “oracle” for the set of perfect elimination orderin...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
AbstractThe class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass o...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
AbstractThe use of (generalized) tree structure in graphs is one of the main topics in the field of ...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractWe show that for graphs of bounded degree, a minimal elimination ordering can be determined ...
We develop a constant time transposition "oracle" for the set of perfect elimination orderings of ch...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
AbstractWe develop a constant time transposition “oracle” for the set of perfect elimination orderin...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
We present an alternative linear time algorithm that computes an ordering that produces a fill-in th...
DOI
Add to ORKG