Engineering DFS-Based Graph Algorithms

@article{Mehlhorn2017EngineeringDG,
  title={Engineering DFS-Based Graph Algorithms},
  author={Kurt Mehlhorn and Stefan N{\"a}her and Peter Sanders},
  journal={CoRR},
  year={2017},
  volume={abs/1703.10023}
}
Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient 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… CONTINUE READING
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Similar Papers

Loading similar papers…