Graph Optimization Problems and Algorithms for DAG-Type Blockchains

Abstract

The scalability of a blockchain is an issue when applying blockchain techniques to the management of mobility history and payment information. One way to solve this problem is to adopt a DAG-type (Directed Acyclic Graph-type) blockchain. We describe methods for analyzing DAG-type blockchains mathematically and for identifying trustworthy blocks from a graph algorithm theoretical perspective.