Results 11 to 20 of about 154,143 (266)
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
GSO:A GNN-based Deep Learning Computation Graph Substitutions Optimization Framework [PDF]
Jisuanji kexue, 2022 Deep learning has achieved great success in various practical applications.How to effectively improve the model execution efficiency is one of the important research issues in this field.The existing deep learning frameworks usually model deep learning ...
MIAO Xu-peng, ZHOU Yue, SHAO Ying-xia, CUI Bin
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
Algorithms on evolving graphs [PDF]
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012 Motivated by applications that concern graphs that are evolving and massive in nature, we define a new general framework for computing with such graphs. In our framework, the graph changes over time and an algorithm can only track these changes by explicitly probing the graph.
Aris Anagnostopoulos +4 more
openaire +3 more sources
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
Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks
Mathematics, 2021 The increasing trend of GPS-enabled smartphones has led to the tremendous usage of Location-Based Service applications. In the past few years, a significant amount of studies have been conducted to process All nearest neighbor (ANN) queries. An ANN query
Aavash Bhandari +4 more
doaj +1 more source
CoRR, 2019 The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on the use of formal program verification to achieve an even higher level of trustworthiness.
Abdulaziz, M., Mehlhorn, K., Nipkow, T.
openaire +4 more sources
Average Sensitivity of Graph Algorithms [PDF]
SIAM Journal on Computing, 2021 39 pages, 1 ...
Nithin Varma 0001, Yuichi Yoshida
openaire +2 more sources