Results 31 to 40 of about 839,618 (278)
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
IEEE Access, 2019 Social network data publishing is dynamic, and attackers can perform association attacks based on social network directed graph data at different times.
Xiaolin Zhang +3 more
doaj +1 more source
The Structure of a Graph Inverse Semigroup [PDF]
, 2015 Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E).
Mesyan, Zachary, Mitchell, J. D.
core +3 more sources
The Reduction of Directed Cyclic Graph for Task Assignment Problem
MATEC Web of Conferences, 2018 In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists.
Ariffin W.N.M.
doaj +1 more source
Directed Information Graphs [PDF]
IEEE Transactions on Information Theory, 2015 41 pages, 15 ...
Christopher J. Quinn +2 more
openaire +2 more sources
Journal of Computer and System Sciences, 1971 Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model called the Marked Graph Model.
Frederic G. Commoner +3 more
openaire +2 more sources
Directed network Laplacians and random graph models
Royal Society Open Science, 2021 We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph model. We focus on
Xue Gong +2 more
doaj +1 more source
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
, 2010 Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double stranded DNA string
D.R. Zerbino +5 more
core +1 more source
A Graph Convolution for Signed Directed Graphs
CoRR, 2022 Preprint ...
Ko, Taewook, Kim, Chong-Kwon
openaire +2 more sources
Gromov Hyperbolicity in Directed Graphs [PDF]
Symmetry, 2020 In this paper, we generalize the classical definition of Gromov hyperbolicity to the context of directed graphs and we extend one of the main results of the theory: the equivalence of the Gromov hyperbolicity and the geodesic stability. This theorem has potential applications to the development of solutions for secure data transfer on the internet.
Ana Portilla +3 more
openaire +3 more sources