Functional Graph Algorithms with Depth-First Search (Preliminary Summary)

1994 ◽  
pp. 145-155 ◽  
Author(s):  
David J. King ◽  
John Launchbury
Keyword(s):  
Graph Algorithms ◽  
Depth First Search ◽  
Functional Graph

Two Streamlined Depth-First Search Algorithms

1986 ◽  
Vol 9 (1) ◽  
pp. 85-94
Author(s):  
Robert Endre Tarjan
Keyword(s):  
Directed Graph ◽  
Graph Algorithms ◽  
Undirected Graph ◽  
Linear Time ◽  
Search Algorithms ◽  
Depth First Search ◽  
Time Graph

Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.

TREE OPEN EAR DECOMPOSITION IN PARALLEL GRAPH ALGORITHMS

1995 ◽  
Vol 05 (02) ◽  
pp. 129-138
Author(s):  
LOUIS IBARRA ◽  
DANA RICHARDS
Keyword(s):  
Parallel Algorithm ◽  
Graph Algorithms ◽  
Depth First Search ◽  
Parallel Graph Algorithms ◽  
Crew Pram ◽  
Np Complete ◽  
Ear Decomposition ◽  
Parallel Graph

Tree open ear decomposition has been proposed as a potentially useful technique in parallel graph algorithms. We present an efficient parallel algorithm implementing depth-first search in a graph, given its tree open ear decomposition. The algorithm runs in O( log n) time with O(m) processors on the CREW PRAM, where m is the number of edges in the graph. We also show that the problem of computing such a decomposition is NP-complete, demonstrating the limited utility of the technique.

Depth-First Search and Linear Graph Algorithms

1972 ◽  
Vol 1 (2) ◽  
pp. 146-160 ◽  
Author(s):  
Robert Tarjan
Keyword(s):  
Graph Algorithms ◽  
Depth First Search ◽  
Linear Graph

Inductive graphs and functional graph algorithms

2001 ◽  
Vol 11 (5) ◽  
pp. 467-492 ◽  
Author(s):  
MARTIN ERWIG
Keyword(s):  
Data Structures ◽  
Graph Algorithms ◽  
Graph Model ◽  
Alternative View ◽  
Functional Languages ◽  
Algorithms And Data Structures ◽  
Data Types ◽  
Functional Graph ◽  
Style Of Writing ◽  
Inductive Graphs

We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively defined data types. We show how this graph model can be implemented efficiently, and then we demonstrate how graph algorithms can be succinctly given by recursive function definitions based on the inductive graph view. We also regard this as a contribution to the teaching of algorithms and data structures in functional languages since we can use the functional-style graph algorithms instead of the imperative algorithms that are dominant today.

On the Number of NK-Kauffman Networks Mapped into a Functional Graph

2016 ◽  
Vol 25 (4) ◽  
pp. 329-345
Author(s):  
Federico Zertuche ◽  
Keyword(s):  
Functional Graph

scholarly journals Frameworks for designing in-place graph algorithms

2021 ◽  
Author(s):  
Sankardeep Chakraborty ◽  
Anish Mukherjee ◽  
Venkatesh Raman ◽  
Srinivasa Rao Satti
Keyword(s):  
Graph Algorithms

scholarly journals Optimizing ordered graph algorithms with GraphIt

2020 ◽  
Author(s):  
Yunming Zhang ◽  
Ajay Brahmakshatriya ◽  
Xinyi Chen ◽  
Laxman Dhulipala ◽  
Shoaib Kamil ◽  
...  
Keyword(s):  
Graph Algorithms

scholarly journals Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets

2020 ◽  
Vol 53 (4) ◽  
pp. 378-383
Author(s):  
I. Saadaoui ◽  
Z. Li ◽  
N. Wu ◽  
M. Khalgui
Keyword(s):  
Petri Nets ◽  
Depth First Search ◽  
Search Approach
Sign in / Sign up

Export Citation Format

Share Document