Theory and Techniques for Synthesizing a Family of Graph Algorithms

07/04/2012
by   Srinivas Nedunuri, et al.
0

Although Breadth-First Search (BFS) has several advantages over Depth-First Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of Efficient BFS (EBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a long standing technique from the field of search algorithms. We show how the theory can be used to systematically derive solutions to two graph algorithms, namely the Single Source Shortest Path problem and the Minimum Spanning Tree problem. The solutions are found by making small systematic changes to the derivation, revealing the connections between the two problems which are often obscured in textbook presentations of them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2019

A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees

We present a new fast all-pairs shortest path algorithm for unweighted g...
research
03/27/2013

The Optimality of Satisficing Solutions

This paper addresses a prevailing assumption in single-agent heuristic s...
research
11/09/2022

Lipschitz Continuous Algorithms for Graph Problems

It has been widely observed in the machine learning community that a sma...
research
07/28/2020

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model

Graph sketching is a powerful technique introduced by the seminal work o...
research
07/30/2019

Iterative Budgeted Exponential Search

We tackle two long-standing problems related to re-expansions in heurist...
research
10/19/2020

Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-ha...
research
09/25/2022

Corpus-based Metaphor Analysis through Graph Theoretical Methods

As a contribution to metaphor analysis, we introduce a statistical, data...

Please sign up or login with your details

Forgot password? Click here to reset