Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency

2012 ◽  
Author(s):  
Jatin Chhugani ◽  
Nadathur Satish ◽  
Changkyu Kim ◽  
Jason Sewall ◽  
Pradeep Dubey
Keyword(s):  
Single Node ◽  
Graph Traversal ◽  
Traversal Algorithm

scholarly journals Exploring graph traversal algorithms in graph-based molecular generation

2021 ◽  
Author(s):  
Rocío Mercado ◽  
Esben Bjerrum ◽  
Ola Engkvist
Keyword(s):  
Natural Products ◽  
Search Algorithm ◽  
Molecular Graph ◽  
Molecular Shape ◽  
Generative Models ◽  
Training Data ◽  
Depth First Search ◽  
Graph Traversal ◽  
The Impact ◽  
Traversal Algorithm

Here we explore the impact of different graph traversal algorithms on molecular graph generation. We do this by training a graph-based deep molecular generative model to build structures using a node order determined via either a breadth- or depth-first search algorithm. What we observe is that using a breadth-first traversal leads to better coverage of training data features compared to a depth-first traversal. We have quantified these differences using a variety of metrics on a dataset of natural products. These metrics include: percent validity, molecular coverage, and molecular shape. We also observe that using either a breadth- or depth-first traversal it is possible to over-train the generative models, at which point the results with the graph traversal algorithm are identical

scholarly journals Cayley and Tutte polytopes

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Matjaž Konvalinka ◽  
Igor Pak
Keyword(s):  
Complete Graph ◽  
Tutte Polynomial ◽  
Convex Hulls ◽  
Connected Graphs ◽  
Labeled Trees ◽  
Graph Traversal ◽  
International Audience ◽  
Search Graph ◽  
Traversal Algorithm

International audience Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs. We extend this result to a two-variable deformations, which we call Tutte polytopes. The volume of the latter is given via an evaluation of the Tutte polynomial of the complete graph. Our approach is based on an explicit triangulation of the Cayley and Tutte polytope. We prove that simplices in the triangulations correspond to labeled trees and forests. The heart of the proof is a direct bijection based on the neighbors-first search graph traversal algorithm. Les polytopes de Cayley ont été définis récemment comme des ensembles convexes de compositions de Cayley introduits par Cayley en 1857. Dans ce papier, nous résolvons la conjecture de Braun. Cette dernière exprime le volume du polytopes de Cayley en termes du nombre de graphes connexes. Nous étendons ce résultat à des déformations de polytopes de Cayley à deux variables, à savoir les polytopes de Tutte. Le volume de ces derniers est donnè par une évaluation du polynôme de Tutte du graphe complet. Notre approche est basée sur une triangulation explicite des polytopes de Cayley et Tutte. Nous démontrons que les simplexes de ces triangulations correspondent à des arbres marqués. La pierre angulaire de notre démonstration est une bijection directe basées sur l'algorithme de la recherche du premier voisin sur le graphe.

scholarly journals Space-Efficient Fully Dynamic DFS in Undirected Graphs †

Algorithms ◽  
2019 ◽  
Vol 12 (3) ◽  
pp. 52 ◽  
Author(s):  
Kengo Nakamura ◽  
Kunihiko Sadakane
Keyword(s):  
Undirected Graph ◽  
Undirected Graphs ◽  
Edge Connectivity ◽  
Worst Case ◽  
Depth First Search ◽  
Insertions And Deletions ◽  
Adjacency List ◽  
Graph Traversal ◽  
Dynamic Connectivity ◽  
Traversal Algorithm

Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n + m ) time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G under the condition that edges and vertices are gradually inserted into or deleted from G. We present an algorithm for this problem, which takes worst-case O ( m n · polylog ( n ) ) time per update and requires only ( 3 m + o ( m ) ) log n bits of space. This algorithm reduces the space usage of dynamic DFS algorithm to only 1.5 times as much space as that of the adjacency list of the graph. We also show applications of our dynamic DFS algorithm to dynamic connectivity, biconnectivity, and 2-edge-connectivity problems under vertex insertions and deletions.

Graph Traversal Dynamic Demonstration System Design and Implementation

2013 ◽  
Vol 734-737 ◽  
pp. 2959-2963
Author(s):  
Bang Ze Chen ◽  
Xiao Bo Yang
Keyword(s):  
System Design ◽  
Real Time ◽  
Design And Implementation ◽  
Graph Traversal ◽  
Thick Line ◽  
Dynamic Execution ◽  
The Right ◽  
Traversal Algorithm

The graph vertices design into classes, for each vertex in the design of the abscissa, ordinate and in-degree members, realizes the dynamic demonstration graph traversal algorithm. Around two window synchronization of animation, " traversal sequence " list box list dfs (bfs ) traversal sequence ,with thick line in the left window drawing traversed through the vertices and edges, and in "traversed stack (queue) changes in" real-time text box displays the current traversed through vertices, in the right box demo the process of algorithm dynamic execution.

scholarly journals Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

2017 ◽  
Vol 27 (14) ◽  
pp. 1750215 ◽  
Author(s):  
Boonyarit Changaival ◽  
Martin Rosalie ◽  
Grégoire Danoy ◽  
Kittichai Lavangnananda ◽  
Pascal Bouvry
Keyword(s):  
Language Processing ◽  
Topological Structure ◽  
Chaotic Dynamics ◽  
Computation Time ◽  
Classical Solutions ◽  
Breadth First Search ◽  
Large Graphs ◽  
Database Querying ◽  
Graph Traversal ◽  
Traversal Algorithm

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.

Sign in / Sign up

Export Citation Format

Share Document