Application of Graph Theory and Variants of Greedy Graph Coloring Algorithms for Optimization of Distributed Peer-to-Peer Blockchain Networks

Application of Graph Theory and Variants of Greedy Graph Coloring Algorithms for Optimization of Distributed Peer-to-Peer Blockchain Networks

This paper investigates the application of graph theory and variants of greedy graph coloring algorithms for the optimization of distributed peer-to-peer networks, with a special focus on private blockchain networks. The graph coloring problem, as an NP-hard problem, presents a challenge in determin...

ver descrição completa

Detalhes bibliográficos
Principais autores: Miljenko Švarcmajer, Denis Ivanović, Tomislav Rudec, Ivica Lukić
Formato: Artigo
Idioma:English
Publicado em: MDPI AG 2025-01-01
coleção:Technologies
Assuntos:
greedy algorithms
graph coloring
DSATUR
distributed systems
peer-to-peer networks
connectivity optimization
Acesso em linha:https://www.mdpi.com/2227-7080/13/1/33

Internet

https://www.mdpi.com/2227-7080/13/1/33

Registros relacionados