Buscar
Mostrando ítems 1-10 de 1138
p-BOX: A new graph model
(2015)
In this document, we study the scope of the following graph model: each vertex is assigned to a box in Rd and to a
representative element that belongs to that box. Two vertices are connected by an edge if and only if its ...
On Delta-Graphs And Delta Conjecture
(Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica., 2018)
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 ...
Graph Mining under Linguistic Constraints for Exploring Large Texts
(Revista Computación y Sistemas; Vol. 17 No.2, 2013-06-07)
Abstract. In this paper, we propose an approach to
explore large texts by highlighting coherent sub-parts.
The exploration method relies on a graph representation
of the text according to Hoey’s linguistic model ...
The clique operator on graphs with few P-4's
(Elsevier Science BvAmsterdamHolanda, 2006)
Optimal grid representations
(Wiley Subscription Services, Inc., A Wiley CompanyEstados UnidosInstituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de EngenhariaInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
(Elsevier B.V., 2018)
Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge
intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex
of the graph a nontrivial path on a ...