Corpus ID: 14259297

Engineering DFS-Based Graph Algorithms

  title={Engineering DFS-Based Graph Algorithms},
  author={Kurt Mehlhorn and Stefan N{\"a}her and Peter Sanders},
Depth-rst search (DFS) is the basis for many efcient graph algorithms. We introduce general techniques for efcient implementations of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST. We have obtained similar speed-ups for biconnected components algorithms. We also compare the graph data types of LEDA and BOOST. 
Understanding Trolls with Efficient Analytics of Large Graphs in Neo4j
The design and integration of Neo4j Graph Algorithms are described, its utility is demonstrated with a Twitter Troll analysis, and its performance is shown with a few experiments on large graphs. Expand
Uncertainty Estimation in Vascular Networks
This paper examines two different methods to sample vessel network graphs, a perturbation and a Gibbs sampler, and thereby estimate marginals and quantitatively validate the accuracy of the approximated marginals using true marginals, computed by enumeration. Expand
Navigation for Indoor Robot: Straight Line Movement via Navigator
A new method for indoor robot Straight Line Movement via Navigator (SLMN) is proposed to ensure long linear motion of robot with an acceptable error threshold and realize multiroom navigation and the conception of the depth-first search stack and a unique encode rule on rooms and navigators. Expand


Depth-First Search and Linear Graph Algorithms
  • R. Tarjan
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1972
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected componentsExpand
Heuristics for semi-external depth first search on directed graphs
A set of heuristics is developed which together allow the performance of semi-external DFS for directed graphs in practice, and is between 10 and 200 times faster than the best alternative, a factor that will further increase with future technological developments. Expand
Dividing a Graph into Triconnected Components
An algorithm for dividing a graph into triconnected components is presented and is both theoretically optimal to within a constant factor and efficient in practice. Expand
Path-based depth-first search for strong and biconnected components
  • H. Gabow
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 2000
This note presents depth-first search algorithms for two basic problems, strong and biconnected components, and presents one-pass algorithms that only maintain a representation of the depth- first search path. Expand
A strong-connectivity algorithm and its applications in data flow analysis.
A new linear algorithm for constructing all strongly connected components of a directed graph is presented and how to apply it in iterative solution of data-flow analysis problems is shown to obtain a simple algorithm which improves the Hecht-Ullman algorithm. Expand
Design and Implementation of Efficient Data Types for Static Graphs
A design and an implementation of a family of special and efficient static graph types which fit into the LEDA environment of graphs and algorithms which allow to speed up existing programs written with LEDA's standard graph type without changing the existing code. Expand
Algorithms in C
Algorithms in C is a comprehensive repository of algorithms, complete with code, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Expand
Algorithms for dense graphs and networks on the random access computer
The running time of several graph and network algorithms when applied to dense graphs is improved upon, including how to compute on a machine with word size λ=Ω (logn) a maximal matching in ann-vertex bipartite graph in timeO(n2+n2.5/λ), and how to solve the single source shortest-path problem with integer costs in the range in time0 (n2(logC)/logn). Expand
Efficient Planarity Testing
An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds. Expand
The LEDA Platform of Combinatorial and Geometric Computing
An overview of the LEDA platform for combinatorial and geometric computing and an account of its development are given and some recent theoretical developments are discussed. Expand