Add to ORKGWe present an analysis of the depth-first search algorithm in a random digraph model with geometric outdegree distribution. This problem posed by Don Knuth in his next to appear volume of The Art of Computer Programming gives interesting insight in one of the most elegant and efficient algorithm for graph analysis due to Tarjan
In this thesis, we study randomized algorithms for numerical linear algebra and pattern matching alg...
The theme of this paper is a rather simple method that has proved very potent in the analysis of the...
Printed on archival quality paper. Random graph processes are most often used to investigate theoret...
We present an analysis of the depth-first search algorithm in a random digraph model with geometric ...
In this paper we examine parallel algorithms for performing a depth-first search (DFS) of a directed...
The following is in two parts, corresponding to the two separate topics in the dissertation.Probabil...
We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence tog...
The algorithm selection problem asks to select the best algorithm for a given problem. In the compan...
Computing the strong components of a directed graph is an essential operation for a basic structural...
International audienceAdvances in processing power and memory technology have made multicore compute...
Computing the strong components of a directed graph is an essential operation for a basic structural...
. This paper shows that for a strongly connected planar directed graph of size n, a depth-first sear...
Abstract. We analyze the cost used by a naive exhaustive search algorithm for finding a maximum inde...
The complexities of various search algorithms are considered in terms of time, space, and cost of so...
Best-first search (BFS) expands the fewest nodes among all admissible algorithms us-ing the same cos...
In this thesis, we study randomized algorithms for numerical linear algebra and pattern matching alg...
The theme of this paper is a rather simple method that has proved very potent in the analysis of the...
Printed on archival quality paper. Random graph processes are most often used to investigate theoret...
We present an analysis of the depth-first search algorithm in a random digraph model with geometric ...
In this paper we examine parallel algorithms for performing a depth-first search (DFS) of a directed...
The following is in two parts, corresponding to the two separate topics in the dissertation.Probabil...
We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence tog...
The algorithm selection problem asks to select the best algorithm for a given problem. In the compan...
Computing the strong components of a directed graph is an essential operation for a basic structural...
International audienceAdvances in processing power and memory technology have made multicore compute...
Computing the strong components of a directed graph is an essential operation for a basic structural...
. This paper shows that for a strongly connected planar directed graph of size n, a depth-first sear...
Abstract. We analyze the cost used by a naive exhaustive search algorithm for finding a maximum inde...
The complexities of various search algorithms are considered in terms of time, space, and cost of so...
Best-first search (BFS) expands the fewest nodes among all admissible algorithms us-ing the same cos...
In this thesis, we study randomized algorithms for numerical linear algebra and pattern matching alg...
The theme of this paper is a rather simple method that has proved very potent in the analysis of the...
Printed on archival quality paper. Random graph processes are most often used to investigate theoret...