Results 1 to 10 of about 129,100 (297)

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

Technologies
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, Denis Ivanović, Tomislav Rudec, Ivica Lukić   +3 more
doaj   +4 more sources

IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR [PDF]

Jurnal Informatika, 2010
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, Fery Sofian Efendi, Syaifullah Syaifullah, Mateus Pinto, Pujianto Pujianto, Hendro Steven Tempake   +5 more
doaj   +4 more sources

Multipass greedy coloring of simple uniform hypergraphs [PDF]

Random Structures & Algorithms, 2015
Let $m^*(n)$ be the minimum number of edges in an $n$-uniform simple hypergraph that is not two colorable. We prove that $m^*(n)= (4^n/\ln^2(n))$. Our result generalizes to $r$-coloring of $b$-simple uniform hypergraphs. For fixed $r$ and $b$ we prove that a maximum vertex degree in $b$-simple $n$-uniform hypergraph that is not $r$-colorable must be $
Jakub Kozik
semanticscholar   +8 more sources

Connected greedy coloring $H$-free graphs [PDF]

Discrete Applied Mathematics, 2018
A connected ordering $(v_1, v_2, \ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\{v_1, \ldots, v_{i - 1}\}$ for every $i \in \{2, \ldots, n\}$. A connected greedy coloring (CGC for short) is a coloring obtained by applying the greedy algorithm to a connected ordering. This has been first introduced
Esdras Mota, Ana Silva, Leonardo Sampaio
semanticscholar   +7 more sources

Implementation of the greedy algorithm on graph coloring

Journal of Physics: Conference Series, 2022
Abstract Graph theory is part of the field of mathematics that can be applied in various other fields of science to solve problems. One of them is the problem of determining the color on the map. The map that will be colored here is a map of the Deli Serdang regency which consists of 22 sub-districts.
Tetty Natalia Sipayung, Saib Suwilo, Parapat Gultom, Mardiningsih Mardiningsih   +3 more
semanticscholar   +3 more sources

Implementation of the Greedy Algorithm for Coloring Graph Based on Four-Color Theorem

sudo Jurnal Teknik Informatika, 2022
Graph theory is an advanced subject of mathematics that can be utilized to resolve issues in science. Graph coloring is one of the most well-known problems for determining the color of the map. The map that will be colored here is one of the 21 sub-districts that cover the Medan regency. In order to color the map, a graph model of the map must first be
Nurul Maulida Surbakti, Fanny Ramadhani
semanticscholar   +4 more sources

Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON

IEEE Access
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, Md Arifur Rahman, Md Munjure Mowla, Slawomir Hausman, Piotr Korbel   +4 more
doaj   +3 more sources

A note on random greedy coloring of uniform hypergraphs [PDF]

Random Structures & Algorithms, 2014
The smallest number of edges forming an n-uniform hypergraph which is not r-colorable is denoted by m(n,r). Erd s and Lov sz conjectured that m(n,2)= (n 2^n)$. The best known lower bound m(n,2)= (sqrt(n/log(n)) 2^n) was obtained by Radhakrishnan and Srinivasan in 2000. We present a simple proof of their result.
Danila Cherkashin, Jakub Kozik
semanticscholar   +7 more sources

On the Performance of Mildly Greedy Players in k-Coloring Games

International Symposium on Mathematical Foundations of Computer Science
We study the performance of mildly greedy players in k-coloring games, a relevant subclass of anti-coordination games. A mildly greedy player is a selfish agent who is willing to deviate from a certain strategy profile only if her payoff improves by a factor of more than ε, for some given ε ≥ 0.
Bilò, Vittorio, D'Ascenzo, Andrea, D'Emidio, Mattia, Italiano, Giuseppe F.   +3 more
semanticscholar   +6 more sources

Application of the Greedy Algorithm for Graph Coloring of the Grobogan Regency Map

EIGEN MATHEMATICS JOURNAL, 2022
Peta wilayah kecamatan pada Kabupaten Grobogan dalat dioptimalisasi dengan algoritma Greedy. Titik pada graf mewakili kecamatan dan garis mewakili dua wilayah yang berbatasan langsung.
Ade Ima Afifa Himayati, Muhammad Adib Jauhari Dwi Putra, Erik Maurten Firdaus, Muhammad Faudzi Bahari   +3 more
openalex   +3 more sources