Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

Source URL: www.cs.yale.edu

Forbidden graphs for tree-depth

Source URL: users.uoa.gr

LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth

Source URL: users.uoa.gr

Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

Source URL: cvit.iiit.ac.in

• 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

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

Understanding Idiomatic Traversals Backwards and Forwards Richard Bird, Jeremy Gibbons, Stefan Mehner, Tom Schrijvers, and Janis Voigtl¨ander July 3rd, 2013

Source URL: www.janis-voigtlaender.eu

• Programming language comparisons
• Functional programming
• Programming idioms
• Recursion
• Monad
• Tree traversal
• Map
• Foreach loop
• Depth-first search

June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in

Source URL: pagesperso.lina.univ-nantes.fr

• Graph coloring
• NP-complete problems
• Graph theory
• Matching
• Color-coding
• Graph
• Chromatic polynomial
• Tree-depth

CMG GardenNotes #636 Tree Planting Steps This publication summarizes the tree-planting process. For an in-depth discussion on tree planting, refer to CMG GardenNotes #633, The Science of Planting Trees.

Source URL: www.ext.colostate.edu

A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-depth Jaroslav Neˇsetˇril Patrice Ossona de Mendez Author address:

Source URL: iti.mff.cuni.cz