REVIEW OF THE GRAPHS DIRECTED TO 2024

Authors: Jerzy Dorobisz

Affiliation: Institute of Information Technology and Cyber-security, Faculty of Cybernetics, WAT

Category:

Keywords: Directed Path., Directed Cycle, Score Vector, Underlying Graph, Consecutive Vertex

ABSTRACT. A directed graph, also known as a sgraph or digraph, is a mathematical structure used to model relationships between objects in which the relationships have a specific direction. Unlike undirected graphs, where edges connect vertices without specifying the direction of flow, in directed graphs the edges, also called arcs, have arrows indicating the direction of flow. There are different types of directed graphs, e.g. acyclic graphs (DAG), strongly consistent graphs, Euler graphs. Many algorithms and techniques for analysing directed graphs used to solve different problems. Directed graphs are an important tool in computer science, mathematics, engineering, and play an important role in the field of cyber security, providing a valuable tool for modelling and analysing complex information systems and identifying potential threats.

Read full paper

References:

Augustyn, D. R., & Warchał, Ł. (2011). Application of Bayes networks in query selectivity estimation in the Oracle database server query optimizer. Studia Informatica, 32(1A), 94.

Barodzich, A. (2023). Latin squares and list coloring of graphs (Doctoral dissertation, Department of Algebra and Combinatorics).

Czarnowska, M., & Migawa, K. (2013). Identification of the operation process of means of transport in the road transport system. Advances in Mechanical Engineering, (1), 18-27.

Wait, M. (2012). An application for visualising different types of graphs.

D. E. Knuth. Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley Professional, 3rd edition, Massachusetts, 1997.

D. J. M.R. Garey. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

Deptuła, A., Zawiślak, S., & Partyka, M. A. (2017). Application of decision logic trees and dependency graphs in the analysis of automatic transmission boxes. Buses: technology, operation, transport systems, 18.

G. Bell, A. Dranishnikov, Asymtotic Dimension in Będlewo, arXiv:math.GR/0507570v2 (2005)

Hajder, M., & Kolbusz, J. (2014). Minimizing the memory complexity of graph models of technical objects.

Holowinski, G., & Malecki, K. (2023). Graph cellular automaton with variable relational cell neighborhoods-assumptions for implementation in FPGA. Measurement Automation Control, 57(8), 861-863.

J. Roe, Lectures on Coarse Geometry, University Lecture Series, American Ma- thematical Society (2003)

K. Z. Y. Han, B. Ma. Spider: Software for protein identification from sequence tags with de novo sequencing error. Journal of Bioinformatics and Computational Biology, 3:697-716, 2005.

Kaminska, A. M. (2018). Application of graph structures for bibliometric and webometric analyses. Models and methods. New Library. Services, Information Technology and Media, 29(2), 47-63.

Kawa, A. (2013). Analysis of enterprise networks using the SNA method. Entrepreneurship and Management, 14(13), 1.

Krawczyk, A. (2016). Exploring Halina graphs with the Python language

Kucharski, P. (2018). Dynamical systems as limits of inverse sequences of graphs.

Laszkiewicz, B., & Sobczak, T. (2022). Analysis and implementation of path finding algorithms for use in browser games. Scientific Bulletin of the Wrocław College of Applied Informatics. Computer Science, 9(1).

M. Cencelj, J. Dydak, A. Vavpetiˇc, Zˇ. Virk, A Combinatorial Approach to Coarse Geometry, arXiv:math.MG/0906.1372v1 (2009)

M. G. C. Resende and C. C. Ribeiro. Greedy randomized adaptive search procedu- res. Handbook of Metaheuristics, pages 716-719, 2003.

Magiera, J. (1995). Graphs as metric spaces. Scientific Works of the Wrocław University of Economics, (696 Didaktyka), 55-65.

MAGISTER, P. D. Implementation of a recursive self-associative network for encoding and classifying directed graphs with labelled vertices.

Malinowski, Ł. (2014). Implementation of selected algorithms for weightless graphs in Python.

Markowski, K. (2008). Existence and determination of positive realizations of linear univariate and multivariate systems (Doctoral dissertation, The Institute of Control and Industrial Electronics).

Matuszak, M. (2011). Bayesian networks in adaptation and optimization of behavioral patterns. Artificial Intelligence, 7006, 204-215.

Mieczkowska, D. (2017). Development and implementation of an algorithm for visualization of directed acyclic graphs in radial layout (Doctoral dissertation, Department of Physics of Complex Systems).

Nowak, R., & Michalowski, A. (2011). Graphs and graph algorithms.

R. Engelking, K. Sieklucki, Geometry and Topology. Part II: Topology, PWN (1980)

Salawa, D. (2020). Analysis of heuristic algorithms for the problem of the set of decimating edges in directed graphs.

Schiff, K. (2011). An algorithm for determining multi-commodity maximum flow in directed graphs. Logistics, (2).

Szestało, P. (2015). Exploring Hamiltonian graphs with the Python language.

Swierczek, A. (2007). From supply chains to supply networks. Logistics, 1, 74-77

Uzawa and T. Oshima. Polypeptide synthesis directed by dna as a messen- ger in cell-free polypeptide synthesis by extreme thermophiles. The Journal of Biochemistry, 131:849-853, 2002.

Wisniewska, M., & Wisniewski, R. (2010). Application of hypergraph coloring in the process of parallel decomposition of concurrent automata. Methods of Applied Computer Science, 23, 151-157.

Wozniak, A. (2010). Graphs and networks in decision-making techniques. Infrastructure and Ecology of Rural Areas, (04).

Wozniak, M. Directed versions of the 1-2-3 and 1-2 hypotheses. combinatorics and cryptography.

Hare, K. (2019). Estimating eigenvalues using directed graphs.

Zwiernik, P. On graphical modelling in the context of time series analysis.