Results 1 to 10 of about 2,196,757 (262)
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications, 2006 We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3-spanner or a 5-spanner under insertions and deletions of edges; on a graph with n ...
Giorgio Ausiello +2 more
doaj +1 more source
A survey of graph-based algorithms for discovering business processes
IJAIN (International Journal of Advances in Intelligent Informatics), 2019 Algorithms of process discovery help analysts to understand business processes and problems in a system by creating a process model based on a log of the system. There are existing algorithms of process discovery, namely graph-based.
Riyanarto Sarno, Kelly Rossa Sungkono
doaj +1 more source
Graph Extremities Defined by Search Algorithms
Algorithms, 2010 Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat +3 more
doaj +1 more source
Undergraduate Students’ Solutions of Modeling Problems in Algorithmic Graph Theory
Mathematics, 2019 Graphs can be considered as useful mathematical models. Graph algorithms are a common part of undergraduate courses in discrete mathematics. Even though they have been successfully implemented in secondary curricula, little research has been dedicated to
Janka Medová +3 more
doaj +1 more source
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert +2 more
doaj +1 more source
Engineering a Combinatorial Laplacian Solver: Lessons Learned
Algorithms, 2016 Linear system solving is a main workhorse in applied mathematics. Recently, theoretical computer scientists contributed sophisticated algorithms for solving linear systems with symmetric diagonally-dominant (SDD) matrices in provably nearly-linear time ...
Daniel Hoske +3 more
doaj +1 more source
Innovative Method of the Evaluation of Multicriterial Multicast Routing Algorithms
Journal of Telecommunications and Information Technology, 2013 Theoretical considerations of the multicast Quality of Service (QoS) routing have been a rapidly developing and dynamic research area for years. Several algorithms derived from different approaches have been proposed, while the pool of valid solutions ...
Krzysztof Stachowiak +1 more
doaj +1 more source
On the predictibility of A-minor motifs from their local contexts
RNA Biology, 2022 This study investigates the importance of the structural context in the formation of a type I/II A-minor motif. This very frequent structural motif has been shown to be important in the spatial folding of RNA molecules.
Coline Gianfrotta +4 more
doaj +1 more source
Applied Sciences, 2023 Artificial Intelligence (AI) nowadays is the technology of the future, as its applications are constantly expanding in every aspect of human life. The spread of the internet has given a great impetus to technologies that apply AI algorithms and make ...
Anastasios Barmpakas, Stelios Xinogalos
doaj +1 more source
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources