Buscar
Mostrando ítems 1-10 de 55
On Models of Directed Path Graphs Non Rooted Directed Path Graphs
(Springer Tokyo, 2016-03)
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of a family of directed subpaths of a rooted tree. Clearly, rooted ...
Asteroidal quadruples in non rooted path graphs
(Discussiones Mathematicae Graph Theory, 2015-01)
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are ...
On rooted directed path graphs
(Unión Matemática Argentina, 2016-06)
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three ...
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 ...
A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks
(Elsevier B.V., 2015-02-10)
We propose a nature-inspired approach to estimate the probability density function (pdf) used for data clustering based on the optimum-path forest algorithm (OPFC). OPFC interprets a dataset as a graph, whose nodes are the ...