Application of Graph Theory and Variants of Greedy Graph Coloring Algorithms for Optimization of Distributed Peer-to-Peer Blockchain Networks [PDF]
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.
Miljenko Švarcmajer +3 more
doaj +3 more sources
IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR
This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah +5 more
doaj +2 more sources
An Ultra-Wideband Handover System for GPS-Free Bridge Inspection Using Drones [PDF]
This study proposes an ultra-wideband (UWB) handover system that increases the range of UWB positioning for bridge inspection using an unmanned aerial vehicle (UAV).
Ping-Hsiang Wang, Ruey-Beei Wu
doaj +2 more sources
Random choices facilitate solutions to collective network coloring problems by artificial agents [PDF]
Summary: Global coordination is required to solve a wide variety of challenging collective action problems from network colorings to the tragedy of the commons.
Matthew I. Jones +2 more
doaj +2 more sources
Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON
The time and wavelength division multiplexing passive optical network (TWDM-PON) allows numerous users to share a single optical fiber and wavelength. In TWDM-PON, the optical network unit (ONU) has different upstream and downstream user traffic to serve
Sandra Arnaout +4 more
doaj +2 more sources
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring [PDF]
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$ colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in the semi-streaming model.
Sepehr Assadi +2 more
doaj +1 more source
A NOVEL GREEDY GENETIC ALGORITHM TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM [PDF]
In this paper, a modified genetic algorithm based on greedy sequential algorithm is presented to solve combinatorial optimization problem. The algorithm proposed here is a hybrid of heuristic and computational intelligence algorithm where greedy ...
M. A. Basmassi +2 more
doaj +1 more source
A new efficient RLF-like algorithm for the vertex coloring problem [PDF]
The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices.
Adegbindin Mourchid +2 more
doaj +1 more source
Greedy strategy for some normal m x n closing octagons games and winning strategy for normal 1 x n and 2 x n closing octagons games [PDF]
m x n Closing Octagons (CO) game is a combinatorial game for two players. The game starts with an m x n array of octagons such that every two adjacent octagons has one common side and 0 points. Players alternately turn by the following rules.
Ratinan Boonklurb +1 more
doaj +1 more source
DESIGN OF WEB-BASED UYU STORE ATTENDANCE INFORMATION SYSTEM USING COLORING METHOD
Attendance in the world of work is sometimes still done manually. At the Uyu shop, there are still problems that occur in recording and making attendance reports manually, such as mistakes in biodata, forgetting to record the date.
Christy Octavius, Deny Hidayatullah
doaj +1 more source

