Depth-first search - PDFSEARCH.IO - Document Search Engine

Depth-first search
Results: 101

#	Item
1	Source-side Preordering for Translation using Logistic Regression and Depth-first Branch-and-Bound Search∗ Laura Jehl? ? Adri`a de Gispert‡ Add to Reading List Source URL: aclweb.org Language: English - Date: 2014-04-18 06:11:01
2	Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science Add to Reading List Source URL: galois.com Language: English - Date: 2016-10-04 14:26:18 Graph theory Graph connectivity Graph traversal Depth-first search Bridge Biconnected component Cycle Strongly connected component Connected component Reachability Graph Connectivity
3	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud Add to Reading List Source URL: chargueraud.org Language: English - Date: 2015-09-30 09:17:22
4	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud Add to Reading List Source URL: www.chargueraud.org - Date: 2015-09-30 09:17:22
5	Selective Depth-First Search Methods Yngvi Bj¨ ornsson and Tony Marsland Department of Computing Science University of Alberta Edmonton, Alberta Add to Reading List Source URL: www.top-5000.nl - Date: 2007-02-08 08:10:32
6	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved Add to Reading List Source URL: mug.mvapich.cse.ohio-state.edu Language: English - Date: 2015-11-20 13:17:47 Graph theory Mathematics Search algorithms Graph traversal Breadth-first search Vertex NP-complete problems Graph coloring Planar graphs Depth-first search
7	6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-04-12 22:48:03 Graph theory Mathematics Search algorithms Algebraic graph theory Graph connectivity Adjacency matrix Matrices Depth-first search Adjacency list Breadth-first search Graph Topological sorting
8	Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE Add to Reading List Source URL: cvit.iiit.ac.in Language: English - Date: 2015-08-05 23:33:31 Graph theory Mathematics Search algorithms Spanning tree Computer programming Routing algorithms Combinatorial optimization Edsger W. Dijkstra Pointer jumping Minimum spanning tree Tree Depth-first search
9	Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-14 05:26:21 Graph theory Graph connectivity Cycle Eulerian path Topological sorting Directed acyclic graph Strongly connected component Connected component Directed graph Graph Cyclic graph Depth-first search
10	Parallel Disk-Based Computation for Large, Monolithic Binary Decision Diagrams Daniel Kunkle∗ Vlad Slavici Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2010-07-26 07:30:31 Computing Diagrams Boolean algebra Mathematics Computer programming Binary decision diagram Model checking External sorting Computer cluster Depth-first search