Buscar
Mostrando ítems 1-10 de 2021
Recognizing clique graphs of directed edge path graphs
(Elsevier Science BvAmsterdamHolanda, 2003)
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 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 ...
Foundations of modern query languages for graph databases
(Association for Computing Machinery, 2017)
We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge-labelled graphs, where nodes are connected by directed, labelled edges, and property graphs, ...
Some remarks on cycles in graphs and digraphs
(ELSEVIER SCIENCE BV, 2001-04-28)
We surveyseveral recent results on cycles of graphs and directed graphs of the following form:
‘Does there exist a set of cycles with a property P that generates all the cycles by operation
O?’.
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 ...