Parallel De Bruijn Graph Construction and Traversal for De Novo Genome Assembly Evangelos Georganas†,‡ , Aydın Buluc¸† , Jarrod Chapman∗ Leonid Oliker† , Daniel Rokhsar∗,¶ , Katherine Yelick†,‡ Computa

Source URL: crd.lbl.gov

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

Source URL: mug.mvapich.cse.ohio-state.edu

• Graph theory
• Mathematics
• Search algorithms
• Graph traversal
• Breadth-first search
• Vertex
• NP-complete problems
• Graph coloring
• Planar graphs
• Depth-first search

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

Source URL: theory.stanford.edu

• Graph theory
• Network flow
• Mathematics
• EdmondsKarp algorithm
• Flow network
• Maximum flow problem
• FordFulkerson algorithm
• Cut
• Graph traversal
• Minimum cut
• Shortest path problem
• Max-flow min-cut theorem

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

Source URL: webee.technion.ac.il

• Graph theory
• Binary trees
• Computer programming
• Software engineering
• Tree traversal
• Linked list
• B-tree
• T-tree
• Trie
• Tree
• Redblack tree

Distributed Computing Prof. R. Wattenhofer BA/SA: Online Graph Exploration

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Online algorithm
• Line graph
• Graph
• Graph coloring
• Operations research
• Edsger W. Dijkstra
• Graph traversal
• Edge coloring

Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

Source URL: cgm.cs.mcgill.ca

• Computer programming
• Mathematics
• Software engineering
• Graph connectivity
• Connectivity
• Tree traversal
• Search algorithms
• NP-complete problems
• Biconnected component
• HopcroftKarp algorithm

Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of Utah

Source URL: mug.mvapich.cse.ohio-state.edu

• Mathematics
• Graph theory
• Discrete mathematics
• Search algorithms
• Graph traversal
• Breadth-first search
• Vertex
• Connectivity
• Shortest path problem
• Graph coloring
• Planar separator theorem

Tree Search Guoliang Li Motivation Problem Applications Metrics

Source URL: i.cs.hku.hk

• Computer programming
• Graph theory
• Software engineering
• Data types
• Recursion
• Tree traversal
• R-tree
• B-tree
• Tree
• Graph edit distance

Basics DFS Framework Implementations

Source URL: www-tcs.cs.uni-sb.de

• Graph theory
• Graph connectivity
• Depth-first search
• Cycle
• Connected component
• Graph
• Strongly connected component
• Ear decomposition
• Tree
• Bridge
• Graph traversal