An Implementation of Depth-First and Breadth-First Search Algorithms for Tip Selection in IOTA Distributed Ledger.
Andras FerencziCostin BadicaPublished in: ACIIDS (1) (2022)
Keyphrases
- search algorithm
- search strategy
- search tree
- iterative deepening
- heuristic search
- branch and bound
- search space
- selection algorithm
- efficient implementation
- tabu search
- fault tolerant
- distributed constraint satisfaction problems
- search methods
- distributed systems
- tree search
- cooperative
- layered architecture
- branch and bound search
- search strategies
- computing environments
- simulated annealing
- state space
- hill climbing
- distributed data
- path finding
- depth first search
- breadth first search
- data structure