2022
DOI: 10.1007/978-3-031-21743-2_28
|View full text |Cite
|
Sign up to set email alerts
|

An Implementation of Depth-First and Breadth-First Search Algorithms for Tip Selection in IOTA Distributed Ledger

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…Then, we use a breadth-first search (BFS) to go backward in time in G S and temporarily remove all R S k,i that would have lost all their child nodes R S k,i , if V lost C C j (line 6) [33]. We then go forward in time to the final time step and temporarily remove all R S k,i that would transitively have lost all their parent nodes R S k,i (line 7), which is again a BFS.…”
Section: B Using Predictions In Negotiationsmentioning
confidence: 99%
“…Then, we use a breadth-first search (BFS) to go backward in time in G S and temporarily remove all R S k,i that would have lost all their child nodes R S k,i , if V lost C C j (line 6) [33]. We then go forward in time to the final time step and temporarily remove all R S k,i that would transitively have lost all their parent nodes R S k,i (line 7), which is again a BFS.…”
Section: B Using Predictions In Negotiationsmentioning
confidence: 99%