Buscar
Mostrando ítems 1-5 de 5
On basic chordal graphs and some of its subclasses
(Elsevier Science, 2016-09)
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its ...
On the correspondence between tree representations of chordal and dually chordal graphs
(Elsevier, 2014-02)
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a ...
Introducing subclasses of basic chordal graphs
(Elsevier Science, 2013-11)
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its ...
Arboricity, h-Index, and Dynamic Algorithms
(Elsevier Science, 2012-04)
We propose a new data structure for manipulating graphs, called -graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each ...