Journal ArticleDOI
A new algorithm for finding weak components
Reads0
Chats0
About:
This article is published in Information Processing Letters.The article was published on 1974-07-01. It has received 4 citations till now. The article focuses on the topics: Tarjan's strongly connected components algorithm & Topological sorting.read more
Citations
More filters
Journal ArticleDOI
Edge-disjoint spanning trees and depth-first search
TL;DR: An algorithm for finding two edge-disjoint spanning trees rooted at a fixed vertex of a directed graph using depthfirst search and an efficient method for computing disjoint set unions is presented.
Journal ArticleDOI
Complexity of combinatorial algorithms
TL;DR: This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results.
Book ChapterDOI
CHAPTER 10 – Graph Algorithms
TL;DR: This chapter provides an overview of the common paradigms and results in graph algorithms with an emphasis on the more recent developments in the field, as well as some common optimalization problems on graphs.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Journal ArticleDOI
Finding Dominators in Directed Graphs
TL;DR: This paper describes an algorithm for finding dominators in an arbitrary directed graph that uses depth-first search and efficient algorithms for computing disjoint set unions and manipulating priority queues to achieve a time bound of $O(V\log V + E)$ if V is the number of vertices and E is thenumber of edges in the graph.
Related Papers (5)
On the robustness of complex networks by using the algebraic connectivity
A. Jamakovic,P. Van Mieghem +1 more