Log in

Relevant bibliographies by topics / Directed graph / Journal articles

To see the other types of publications on this topic, follow the link: Directed graph.

Journal articles on the topic 'Directed graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Directed graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Fujita, Takaaki. "Review of Rough Turiyam Neutrosophic Directed Graphs and Rough Pentapartitioned Neutrosophic Directed Graphs." Neutrosophic Optimization and Intelligent Systems 5 (March 4, 2025): 48–79. https://doi.org/10.61356/j.nois.2025.5500.

Full text

Abstract:

Graph theory, a fundamental branch of mathematics, examines relationships between entities through the use of vertices and edges. Within this field, Uncertain Graph Theory has developed as a powerful framework to represent the uncertainties found in real world networks. Among the various uncertain graph models, Turiyam Neutrosophic Graphs and Pentapartitioned Neutrosophic Graphs are well-established. However, their extension to Directed Graphs remains relatively unexplored. To address this gap, this paper presents the concepts of the Turiyam Neutrosophic Directed Graph and the Pentapartitioned

APA, Harvard, Vancouver, ISO, and other styles

2

Ambarwati, Aditya, and Vira Hari Krisnawati. "CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES." BAREKENG: Jurnal Ilmu Matematika dan Terapan 17, no. 4 (2023): 2095–106. http://dx.doi.org/10.30598/barekengvol17iss4pp2095-2106.

Full text

Abstract:

A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same. The cycles in bicyclic graph can be of different lengths and shapes, but they must have at least one common vertex. Bicyclic graphs can be divided into two categories based on the types of induced subgraphs they contain. One category consists of graphs that include an -graph as an induced subgraph, while the other category comprises graphs that contain a -graph as an induced subgraph. There are 3

APA, Harvard, Vancouver, ISO, and other styles

3

Pardo-Guerra, Sebastian, Vivek Kurien George, Vikash Morar, Joshua Roldan, and Gabriel Alex Silva. "Extending Undirected Graph Techniques to Directed Graphs via Category Theory." Mathematics 12, no. 9 (2024): 1357. http://dx.doi.org/10.3390/math12091357.

Full text

Abstract:

We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘prime graphs category’; this has as objects labeled undirected bipartite graphs (which we call prime graphs), and as morphisms undirected graph morphisms that preserve the labeling (which we call prime graph morphisms). This theoretical bridge allows us to extend undirected graph techniques to directed graphs by converting the directed graphs

APA, Harvard, Vancouver, ISO, and other styles

4

Yan, Jun, Yihui Zhou, and Laifeng Lu. "A Node Differential Privacy-Based Method to Preserve Directed Graphs in Wireless Mobile Networks." Applied Sciences 13, no. 14 (2023): 8089. http://dx.doi.org/10.3390/app13148089.

Full text

Abstract:

With the widespread popularity of Wireless Mobile Networks (WMNs) in our daily life, the huge risk to disclose personal privacy of massive graph structure data in WMNs receives more and more attention. Particularly, as a special type of graph data in WMNs, the directed graph contains an amount of sensitive personal information. To provide secure and reliable privacy preservation for directed graphs in WMNs, we develop a node differential privacy-based method, which combines differential privacy with graph modification. In the method, the original directed graph is first divided into several su

APA, Harvard, Vancouver, ISO, and other styles

5

Bauer, Frank. "Normalized graph Laplacians for directed graphs." Linear Algebra and its Applications 436, no. 11 (2012): 4193–222. http://dx.doi.org/10.1016/j.laa.2012.01.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kalampakas, Antonios, and Stefanos Spartalis. "Hyperoperations on directed graphs." Journal of Discrete Mathematical Sciences and Cryptography 27, no. 3 (2024): 1011–25. http://dx.doi.org/10.47974/jdmsc-1714.

Full text

Abstract:

We analyze three hyper-operations derived from directed graphs, demonstrate the influence of the underlying graph structure on these hyper-operations and study the algebraic properties of the related classes of graphs. The paper also illustrates the relationship between directed graphs and hyper-structures using graph hyper-operations. In addition, we investigate the property of commutativity for an appropriate type of hyper-groupoids and its relationship to properties of directed graphs. Therefore, the paper consists of three sections, section one introduces and investigates three distinct hy

APA, Harvard, Vancouver, ISO, and other styles

7

Zhu, Shijie, Jianxin Li, Hao Peng, Senzhang Wang, and Lifang He. "Adversarial Directed Graph Embedding." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 5 (2021): 4741–48. http://dx.doi.org/10.1609/aaai.v35i5.16605.

Full text

Abstract:

Node representation learning for directed graphs is critically important to facilitate many graph mining tasks. To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each node, source vector and target vector. However, these methods learn the source and target vectors separately. For the node with very low indegree or outdegree, the corresponding target vector or source vector cannot be effectively learned. In this paper, we propose a novel Directed Graph embedding framework based on Generative Adversarial Network, called DGGAN. The main idea is t

APA, Harvard, Vancouver, ISO, and other styles

8

Hou, Guoqiang, Qiwen Yu, Fan Chen, and Guang Chen. "Directed Knowledge Graph Embedding Using a Hybrid Architecture of Spatial and Spectral GNNs." Mathematics 12, no. 23 (2024): 3689. http://dx.doi.org/10.3390/math12233689.

Full text

Abstract:

Knowledge graph embedding has been identified as an effective method for node-level classification tasks in directed graphs, the objective of which is to ensure that nodes of different categories are embedded as far apart as possible in the feature space. The directed graph is a general representation of unstructured knowledge graphs. However, existing methods lack the ability to simultaneously approximate high-order filters and globally pay attention to the task-related connectivity between distant nodes for directed graphs. To address this limitation, a directed spectral graph transformer (D

APA, Harvard, Vancouver, ISO, and other styles

9

Sugeng, Kiki A., Fery Firmansah, Wildan, Bevina D. Handari, Nora Hariadi, and Muhammad Imran. "Several properties of antiadjacency matrices of directed graphs." AIMS Mathematics 9, no. 10 (2024): 27834–47. http://dx.doi.org/10.3934/math.20241351.

Full text

Abstract:

<p>Let $ G $ be a directed graph with $ \mathrm{o}\mathrm{r}\mathrm{d}\mathrm{e}\mathrm{r}\; n. $ The adjacency matrix of the directed graph $ G $ is a matrix $ A = \left[{a}_{ij}\right] $ of order $ n\times n, $ such that for $ i\ne j $, if there is an arc from $ i $ to $ j, $ then $ {a}_{ij} = 1 $, otherwise $ {a}_{ij} = 0 $. Matrix $ B = J-A $ is called the antiadjacency matrix of the directed graph $ G, $ where $ J $ is the matrix of order $ n\times n $ with all of those entries are one. In this paper, we provided several properties of the adjacency matrices of directed graphs, such

APA, Harvard, Vancouver, ISO, and other styles

10

Gyürki, Štefan. "Small Directed Strongly Regular Graphs." Algebra Colloquium 27, no. 01 (2020): 11–30. http://dx.doi.org/10.1142/s1005386720000036.

Full text

Abstract:

The goal of the present paper is to provide a gallery of small directed strongly regular graphs. For each graph of order n ≤ 12 and valency k < n/2, a diagram is depicted, its relation to other small directed strongly regular graphs is revealed, the full group of automorphisms is described, and some other nice properties are given. To each graph a list of interesting subgraphs is provided as well.

APA, Harvard, Vancouver, ISO, and other styles

11

Kollias, Georgios, Vasileios Kalantzis, Tsuyoshi Ide, Aurélie Lozano, and Naoki Abe. "Directed Graph Auto-Encoders." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 7 (2022): 7211–19. http://dx.doi.org/10.1609/aaai.v36i7.20682.

Full text

Abstract:

We introduce a new class of auto-encoders for directed graphs, motivated by a direct extension of the Weisfeiler-Leman algorithm to pairs of node labels. The proposed model learns pairs of interpretable latent representations for the nodes of directed graphs, and uses parameterized graph convolutional network (GCN) layers for its encoder and an asymmetric inner product decoder. Parameters in the encoder control the weighting of representations exchanged between neighboring nodes. We demonstrate the ability of the proposed model to learn meaningful latent embeddings and achieve superior perform

APA, Harvard, Vancouver, ISO, and other styles

12

Gavril, Fanica. "Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550061. http://dx.doi.org/10.1142/s1793830915500615.

Full text

Abstract:

A graph is a directed path overlap graph if it is the overlap graph of family of directed paths in a rooted directed tree. A graph is a multiclique if its connected components are cliques. A graph is a complete multipartite graph if it is the complement of a multiclique. A graph is a multiclique-multipartite graph if its vertex set has a partition [Formula: see text], [Formula: see text] such that [Formula: see text] is complete multipartite, [Formula: see text] is a multiclique and every two vertices [Formula: see text], [Formula: see text] are adjacent. We describe a polynomial time algorith

APA, Harvard, Vancouver, ISO, and other styles

13

CHENG, EDDIE, and MARC J. LIPMAN. "UNIDIRECTIONAL (n, k)-STAR GRAPHS." Journal of Interconnection Networks 03, no. 01n02 (2002): 19–34. http://dx.doi.org/10.1142/s0219265902000525.

Full text

Abstract:

Arrangement graphs14 and (n, k)-star graphs11 were introduced as generalizations of star graphs1. They were introduced to provide a wider set of choices for the order of topologically attractive interconnection networks. Unidirectional interconnection networks are more appropriate in many applications. Cheng and Lipman5, and Day and Tripathi17 studied the unidirectional star graphs, and Cheng and Lipman7 studied orientation of arrangement graphs. In this paper, we show that every (n, k)-star graph can be oriented to a maximally arc-connected graph when the regularity of the graph is even. If t

APA, Harvard, Vancouver, ISO, and other styles

14

Montanaro, A. "Quantum walks on directed graphs." Quantum Information and Computation 7, no. 1&2 (2007): 93–102. http://dx.doi.org/10.26421/qic7.1-2-5.

Full text

Abstract:

We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices $(v_i, v_j)$, if $v_i$ is connected to $v_j$ then there is a path from $v_j$ to $v_i$. We show that reversibility is a necessary and sufficient condition for a directed graph to allow the notion of a discrete-time quantum walk, and discuss some implications of this condition. We present a method for defining a "partially quantum'' walk on directed graphs that are not reversible.

APA, Harvard, Vancouver, ISO, and other styles

15

Pardo-Guerra, Sebastian, Vivek Kurien George, and Gabriel A. Silva. "On the Graph Isomorphism Completeness of Directed and Multidirected Graphs." Mathematics 13, no. 2 (2025): 228. https://doi.org/10.3390/math13020228.

Full text

Abstract:

The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that the class of all directed graphs is a Graph Isomorphism Complete class. Afterwards, by extending this categorical framework to weighted prime graphs, we prove that the categories of multidirected graphs with and without self-loops are each isomorphic to a particular category of weighted prime graphs. Consequently, we prove that these classes o

APA, Harvard, Vancouver, ISO, and other styles

16

Fleming, Thomas, and Joel Foisy. "Intrinsically knotted and 4-linked directed graphs." Journal of Knot Theory and Its Ramifications 27, no. 06 (2018): 1850037. http://dx.doi.org/10.1142/s0218216518500372.

Full text

Abstract:

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edge contraction and H-cyclic subcontraction, as special cases of minors for digraphs, and show that the property of having a linkless embedding is closed under these operations. We analyze the relationship between the number of distinct knots and links in an undirected graph [Formu

APA, Harvard, Vancouver, ISO, and other styles

17

Montgomery, Richard. "Hamiltonicity in random directed graphs is born resilient." Combinatorics, Probability and Computing 29, no. 6 (2020): 900–942. http://dx.doi.org/10.1017/s0963548320000140.

Full text

Abstract:

AbstractLet $\{D_M\}_{M\geq 0}$ be the n-vertex random directed graph process, where $D_0$ is the empty directed graph on n vertices, and subsequent directed graphs in the sequence are obtained by the addition of a new directed edge uniformly at random. For each $$\varepsilon > 0$$ , we show that, almost surely, any directed graph $D_M$ with minimum in- and out-degree at least 1 is not only Hamiltonian (as shown by Frieze), but remains Hamiltonian when edges are removed, as long as at most $1/2-\varepsilon$ of both the in- and out-edges incident to each vertex are removed. We say such a dir

APA, Harvard, Vancouver, ISO, and other styles

18

Eich, M. H. "Graph directed locking." IEEE Transactions on Software Engineering 14, no. 2 (1988): 133–40. http://dx.doi.org/10.1109/32.4633.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Fujita, Takaaki. "Analytical study on Ultrafilter in Digraph: Directed Tangle and Directed Ultrafilter." Asian Research Journal of Mathematics 21, no. 5 (2025): 132–46. https://doi.org/10.9734/arjom/2025/v21i5929.

Full text

Abstract:

Graph theory examines structures of vertices and edges to model relationships in diverse systems. A directed graph assigns an orientation to each edge, introducing new challenges for structural analysis. Central to this analysis is the notion of width parameters—metrics that capture a graph’s complexity via decompositions—and their dual concept, tangles, which characterize highly connected regions and are famously dual to tree-width. While both width parameters and tangles have been extensively studied in undirected graphs, their extensions to directed graphs (digraphs) have only recently attr

APA, Harvard, Vancouver, ISO, and other styles

20

Kusper, Gábor, and Csaba Biró. "Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model." Algorithms 13, no. 12 (2020): 321. http://dx.doi.org/10.3390/a13120321.

Full text

Abstract:

In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonboglár model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a black and white SAT problem. W

APA, Harvard, Vancouver, ISO, and other styles

21

Li, Wen Sheng, and Hua Ming Xing. "Minus Domination Numbers of Directed Graphs." Advanced Materials Research 267 (June 2011): 334–37. http://dx.doi.org/10.4028/www.scientific.net/amr.267.334.

Full text

Abstract:

The concept of minus domination number of an undirected graph is transferred to directed graphs. Exact values are found for the directed cycle and particular types of tournaments. Furthermore, we present some lower bounds for minus domination number in terms of the order, the maximum degree, the maximum outdegree and the minimum outdegree of a directed graph.

APA, Harvard, Vancouver, ISO, and other styles

22

Zomam, Hanan Omer. "SUPOUT TOPOLOGY ON DIRECTED FUZZY GRAPHS." Advances in Mathematics: Scientific Journal 13, no. 4 (2024): 501–21. http://dx.doi.org/10.37418/amsj.13.4.4.

Full text

Abstract:

In this work, we introduce a topology, called supout topology and denoted $\mathcal{F}^{o}_{\mathcal{G}}$, for a fuzzy directed graph. We study some properties of this topology and give some examples of open and closed sets. We demonstrate that two isomorphic fuzzy directed graphs have homeomorphic supout topologies. In addition, we prove that this topology is an Alexandroff one and then use minimal basis to characterize homeomorphic fuzzy directed graphs. Finally, we investigate the connectedness of this topology vs. the connectivity of the graph.

APA, Harvard, Vancouver, ISO, and other styles

23

FRATI, FABRIZIO. "ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS." International Journal of Computational Geometry & Applications 18, no. 03 (2008): 251–71. http://dx.doi.org/10.1142/s021819590800260x.

Full text

Abstract:

It has been shown that there exist planar digraphs that require exponential area in every upward straight-line planar drawing. On the other hand, upward poly-line planar drawings of planar graphs can be realized in Θ(n2) area. In this paper we consider families of DAGs that naturally arise in practice, like DAGs whose underlying graph is a tree (directed trees), is a bipartite graph (directed bipartite graphs), or is an outerplanar graph (directed outerplanar graphs). Concerning directed trees, we show that optimal Θ(n log n) area upward straight-line/poly-line planar drawings can be construct

APA, Harvard, Vancouver, ISO, and other styles

24

Zhou, Chao, and Yan Ping Liu. "Study on Parameter Transfer Structure of Generalized Modular Based Graph Theory." Advanced Materials Research 562-564 (August 2012): 1323–26. http://dx.doi.org/10.4028/www.scientific.net/amr.562-564.1323.

Full text

Abstract:

For the purpose of reducing product structure levels and shorting transfer chain of parameter, in this paper the product structure levels are expressed with generalized modular. The concept of directed graph of parameter connection structure for generalized modular is proposed with the use of directed graph theory, generalized modular, sub-modular and part represented by vertex, the driven relations of parameter connection represented by directed edge, and the properties of directed graph of parameter connection structure for generalized modular are gained. The directed graph of parameter conn

APA, Harvard, Vancouver, ISO, and other styles

25

KUNDETI, VAMSI, SANGUTHEVAR RAJASEKARAN, and HEIU DINH. "AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 02 (2012): 1250019. http://dx.doi.org/10.1142/s179383091250019x.

Full text

Abstract:

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 (SDDNA) containing all the k-long words in the reads seems to be a good heuristic to get close to the original genome. This problem is equivalent to finding a cyclic Chinese Postman (CP) walk on the underlying unweighted bi-directed de Bruijn graph built from the reads. The Chinese Postman walk Problem (CPP) is solved by reducing it to a gene

APA, Harvard, Vancouver, ISO, and other styles

26

Komáromi, Mátyás, István Bozó, and Melinda Tóth. "Optimising the Force-Directed Layout Generation." Acta Universitatis Sapientiae, Informatica 16, no. 1 (2025): 139–59. https://doi.org/10.47745/ausi-2024-0009.

Full text

Abstract:

A graph visualisation tool can be invaluable in code comprehension. It is a well-known and researched field of graphical informatics. Several good algorithms were developed, but most of the graph drawing tools mainly focus on the generation of static drawing. In this paper, we present an approach to force-directed layout generation that is orders of magnitudes faster than the trivial implementation. This technique is based on the Runge-Kutta methods and is efficient enough to visualise the user-requested parts (views) quickly for relatively large Semantic Program Graphs of Erlang projects in s

APA, Harvard, Vancouver, ISO, and other styles

27

Malik, Shabnam. "Hamiltonicity in Directed Toeplitz Graphs with s 1 = 1 and s 3 = 4." Computational and Mathematical Methods 2023 (April 17, 2023): 1–11. http://dx.doi.org/10.1155/2023/3676487.

Full text

Abstract:

A directed Toeplitz graph T n s 1 , ⋯ , s k ; t 1 , ⋯ , t l with vertices 1 , 2 , ⋯ , n is a directed graph whose adjacency matrix is a Toeplitz matrix. In this paper, we investigate the Hamiltonicity in directed Toeplitz graphs T n s 1 , ⋯ , s k ; t 1 , ⋯ , t l with s 1 = 1 and s 3 = 4 .

APA, Harvard, Vancouver, ISO, and other styles

28

Li, Wenjun, Xueying Yang, Chao Xu, and Yongjie Yang. "An FPT Algorithm for Directed Co-Graph Edge Deletion." Algorithms 17, no. 2 (2024): 69. http://dx.doi.org/10.3390/a17020069.

Full text

Abstract:

In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions. Firstly, we show that the problem is NP-hard. Then, we show that directed co-graphs are fully characterized by eight forbidden structures, each having, at most, six edges. Based on the symmetry properties and several refined observations, we develop a branching algorithm with a running time of O(2.733k), which is significantly more efficient

APA, Harvard, Vancouver, ISO, and other styles

29

Sun, Jiankai, Bortik Bandyopadhyay, Armin Bashizade, Jiongqian Liang, P. Sadayappan, and Srinivasan Parthasarathy. "ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 265–72. http://dx.doi.org/10.1609/aaai.v33i01.3301265.

Full text

Abstract:

Directed graphs have been widely used in Community Question Answering services (CQAs) to model asymmetric relationships among different types of nodes in CQA graphs, e.g., question, answer, user. Asymmetric transitivity is an essential property of directed graphs, since it can play an important role in downstream graph inference and analysis. Question difficulty and user expertise follow the characteristic of asymmetric transitivity. Maintaining such properties, while reducing the graph to a lower dimensional vector embedding space, has been the focus of much recent research. In this paper, we

APA, Harvard, Vancouver, ISO, and other styles

30

KALAMPAKAS, ANTONIOS, and OLYMPIA LOUSCOU-BOZAPALIDOU. "MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS." International Journal of Foundations of Computer Science 24, no. 04 (2013): 519–31. http://dx.doi.org/10.1142/s0129054113500184.

Full text

Abstract:

We introduce planar directed acyclic graph algebras and present an explicit minimization method. The minimal simulation of a nondeterministic automaton on planar directed acyclic graphs is constructed.

APA, Harvard, Vancouver, ISO, and other styles

31

Yuster, Raphael. "Packing and Covering a Given Directed Graph in a Directed Graph." SIAM Journal on Discrete Mathematics 38, no. 1 (2024): 43–54. http://dx.doi.org/10.1137/22m1534134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Genova, Daniela, Hendrik Jan Hoogeboom, and Nataša Jonoska. "Companions and an Essential Motion of a Reaction System." Fundamenta Informaticae 175, no. 1-4 (2020): 187–99. http://dx.doi.org/10.3233/fi-2020-1953.

Full text

Abstract:

For a family of sets we consider elements that belong to the same sets within the family as companions. The global dynamics of a reactions system (as introduced by Ehrenfeucht and Rozenberg) can be represented by a directed graph, called a transition graph, which is uniquely determined by a one-out subgraph, called the 0-context graph. We consider the companion classes of the outsets of a transition graph and introduce a directed multigraph, called an essential motion, whose vertices are such companion classes. We show that all one-out graphs obtained from an essential motion represent 0-conte

APA, Harvard, Vancouver, ISO, and other styles

33

Abu-Affash, A. Karim, Paz Carmi, and Anat Parush Tzur. "Strongly Connected Spanning Subgraph for Almost Symmetric Networks." International Journal of Computational Geometry & Applications 27, no. 03 (2017): 207–19. http://dx.doi.org/10.1142/s0218195917500042.

Full text

Abstract:

In the strongly connected spanning subgraph ([Formula: see text]) problem, the goal is to find a minimum weight spanning subgraph of a strongly connected directed graph that maintains the strong connectivity. In this paper, we consider the [Formula: see text] problem for two families of geometric directed graphs; [Formula: see text]-spanners and symmetric disk graphs. Given a constant [Formula: see text], a directed graph [Formula: see text] is a [Formula: see text]-spanner of a set of points [Formula: see text] if, for every two points [Formula: see text] and [Formula: see text] in [Formula:

APA, Harvard, Vancouver, ISO, and other styles

34

Ma, Chenhao, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, Wenjie Zhang, and Xuemin Lin. "On Directed Densest Subgraph Discovery." ACM Transactions on Database Systems 46, no. 4 (2021): 1–45. http://dx.doi.org/10.1145/3483940.

Full text

Abstract:

Given a directed graph G , the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G , whose density is the highest among all the subgraphs of G . The DDS problem is fundamental to a wide range of applications, such as fraud detection, community mining, and graph compression. However, existing DDS solutions suffer from efficiency and scalability problems: on a 3,000-edge graph, it takes three days for one of the best exact algorithms to complete. In this article, we develop an efficient and scalable DDS solution. We introduce the notion of [ x , y ]-core, which is

APA, Harvard, Vancouver, ISO, and other styles

35

Rankooh, Masood Feyzbakhsh, and Jussi Rintanen. "Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (2022): 5861–68. http://dx.doi.org/10.1609/aaai.v36i5.20530.

Full text

Abstract:

We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs, based on vertex elimination graphs, which makes them suitable for cases where the underlying graph has a low directed elimination width. In contrast to solvers with ad hoc constraint propagators for graph constraints such as GraphSAT, our methods encode these constraints as standard propositional clauses, making them directly applicable with any SAT solver. An empirical study demonstrates that our methods do often outperform both earlier encodings of t

APA, Harvard, Vancouver, ISO, and other styles

36

Duval, Art M. "A directed graph version of strongly regular graphs." Journal of Combinatorial Theory, Series A 47, no. 1 (1988): 71–100. http://dx.doi.org/10.1016/0097-3165(88)90043-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Sardellitti, Stefania, Sergio Barbarossa, and Paolo Di Lorenzo. "On the Graph Fourier Transform for Directed Graphs." IEEE Journal of Selected Topics in Signal Processing 11, no. 6 (2017): 796–811. http://dx.doi.org/10.1109/jstsp.2017.2726979.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Fan, Shaohua, Shuyang Zhang, Xiao Wang, and Chuan Shi. "Directed Acyclic Graph Structure Learning from Dynamic Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 6 (2023): 7512–21. http://dx.doi.org/10.1609/aaai.v37i6.25913.

Full text

Abstract:

Estimating the structure of directed acyclic graphs (DAGs) of features (variables) plays a vital role in revealing the latent data generation process and providing causal insights in various applications. Although there have been many studies on structure learning with various types of data, the structure learning on the dynamic graph has not been explored yet, and thus we study the learning problem of node feature generation mechanism on such ubiquitous dynamic graph data. In a dynamic graph, we propose to simultaneously estimate contemporaneous relationships and time-lagged interaction relat

APA, Harvard, Vancouver, ISO, and other styles

39

Brewster, David A., Martin A. Nowak, and Josef Tkadlec. "Fixation times on directed graphs." PLOS Computational Biology 20, no. 7 (2024): e1012299. http://dx.doi.org/10.1371/journal.pcbi.1012299.

Full text

Abstract:

Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate r which invades a population of residents. We say that the fixation time is “fast” if it is at most a polynomial function in terms of the population size N. Here we study fixation times of advantageous mutants (r > 1) and neutral mutants (r = 1) on directed graphs, which are those graphs that have at least some one-way connections. We obtain three main results. First, we prove that for any directed graph the fixation time is

APA, Harvard, Vancouver, ISO, and other styles

40

Beasley, LeRoy B. "Cordial Digraphs." Journal of Combinatorial Mathematics and Combinatorial Computing 121, no. 1 (2024): 59–66. http://dx.doi.org/10.61091/jcmcc121-06.

Full text

Abstract:

A ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph. We extend this concept to directed graphs and investigate the cordiality of directed graphs. We show that all directed paths and all directed cycles are cordial. We also discuss the cordiality of oriented trees and other digraphs.

APA, Harvard, Vancouver, ISO, and other styles

41

Gonçalves, Daniel, Hui Li, and Danilo Royer. "Faithful Representations of Graph Algebras via Branching Systems." Canadian Mathematical Bulletin 59, no. 01 (2016): 95–103. http://dx.doi.org/10.4153/cmb-2015-032-x.

Full text

Abstract:

Abstract We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a suõcient condition under which the representation induced from a branching systemof a directed graph is faithful and construct a large class of branching systems that satisfy this condition. We ûnish the paper by providing a proof of the converse of the Cuntz–Krieger uniqueness theorem for graph algebras by means of branching systems.

APA, Harvard, Vancouver, ISO, and other styles

42

Kelarev, A. V., and O. V. Sokratova. "Syntactic semigroups and graph algebras." Bulletin of the Australian Mathematical Society 62, no. 3 (2000): 471–77. http://dx.doi.org/10.1017/s0004972700018992.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Talvitie, Topi, and Mikko Koivisto. "Counting and Sampling Markov Equivalent Directed Acyclic Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7984–91. http://dx.doi.org/10.1609/aaai.v33i01.33017984.

Full text

Abstract:

Exploring directed acyclic graphs (DAGs) in a Markov equivalence class is pivotal to infer causal effects or to discover the causal DAG via appropriate interventional data. We consider counting and uniform sampling of DAGs that are Markov equivalent to a given DAG. These problems efficiently reduce to counting the moral acyclic orientations of a given undirected connected chordal graph on n vertices, for which we give two algorithms. Our first algorithm requires O(2nn4) arithmetic operations, improving a previous superexponential upper bound. The second requires O(k!2kk2n) operations, where k

APA, Harvard, Vancouver, ISO, and other styles

44

WangRID="*"ID="*" This research was, Hong. "Independent Directed Triangles in a Directed Graph." Graphs and Combinatorics 16, no. 4 (2000): 453–62. http://dx.doi.org/10.1007/pl00007230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Zhang, Danhong, and Hong Wang. "Disjoint directed quadrilaterals in a directed graph." Journal of Graph Theory 50, no. 2 (2005): 91–104. http://dx.doi.org/10.1002/jgt.20096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

SPIELBERG, JACK. "A FUNCTORIAL APPROACH TO THE C*-ALGEBRAS OF A GRAPH." International Journal of Mathematics 13, no. 03 (2002): 245–77. http://dx.doi.org/10.1142/s0129167x02001319.

Full text

Abstract:

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to the category of C*-algebras with injective *-homomorphisms. The resulting C*-algebras are identified as Toeplitz graph algebras. Graph algebras are proved to have inductive limit decompositions over any family of subgraphs with union equal to the whole graph. The construction is used to prove various structural properties of graph algebras.

APA, Harvard, Vancouver, ISO, and other styles

47

P. Kamal Devi. "Identification of shortest path with Dijkstra’s algorithm through the distribution function analysis of flow and connectivity in non-directed graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2346–51. http://dx.doi.org/10.26637/mjm0804/0180.

Full text

Abstract:

A non-directed graph is one type graph and these nodes are connected by non-directed arcs. A non-directed arc is an edge that has no arrow. Both ends of a non-directed arc are equivalent-there is no head tail. Therefore, this paper represents an edge in a non-directed graph as a set rather than an ordered pair which is assigned with weighted path. So it is important to calculate to find the shortest path in assigned graphs. Dijkstra algorithm is one of the familiar methods to find shortest paths from point to another point in a graph. It is also known as single source shortest path algorithm a

APA, Harvard, Vancouver, ISO, and other styles

48

Fujita, Takaaki. "Ultrafilter in Digraph: Directed Tangle and Directed Ultrafilter." Journal of Advances in Mathematics and Computer Science 39, no. 3 (2024): 37–42. http://dx.doi.org/10.9734/jamcs/2024/v39i31874.

Full text

Abstract:

Tangle is a concept in graph theory that has a dual relationship with tree-width which is well-known graph width parameter. Ultrafilter is a fundamental notion in mathematics. In this concise paper, we will reconsider the relationship between Tangle and Ultrafilter in digraph.

APA, Harvard, Vancouver, ISO, and other styles

49

Koseki, Akira, Hideaki Komatsu, and Toshio Nakatani. "Preference-directed graph coloring." ACM SIGPLAN Notices 37, no. 5 (2002): 33–44. http://dx.doi.org/10.1145/543552.512535.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Shubha, B. G., and A.M.Prasad. "Airflow Directed Acyclic Graph." Journal of Signal Processing 5, no. 2 (2019): 12–20. https://doi.org/10.5281/zenodo.3247274.

Full text

Abstract:

<em>The paper “Airflow Dags” is based on the generation of directed acyclic graphs during the creation of profiles and roles in the Enterprise management software. Profiles are facilities that are provided to the clients in organization, they are seen in the configuration view of enterprise software. Roles are the permissions and the access that is given to a client. Automation is necessary to make repetitive and difficult procedures simpler. In this case the automation is done so that the onboarding of new clients in organization is done in an easier way. Previously this was done

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!