Results 11 to 20 of about 129,100 (297)
Sum list coloring, the sum choice number, and sc-greedy graphs [PDF]
, 2013 Let G=(V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is said that G is f-choosable if for every assignment of lists of colors to the vertices of G for which the list sizes agree with f, there exists a proper coloring of G from the lists.
Michelle Anne Lastrina, Michael E. Young
core +5 more sources
Greedy colorings of uniform hypergraphs [PDF]
Random Structures & Algorithms, 2009 AbstractWe give a very short proof of an Erdős conjecture that the number of edges in a non‐2‐colorable n‐uniform hypergraph is at least f(n)2n, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least clog n. With an ingenious recoloring idea he later proved that f(n) ≥ cn1/3+o(1). Here we prove a weaker
András Pluhár
openalex +3 more sources
The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring [PDF]
International Colloquium on Automata, Languages and Programming, 2021 Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no online edge-coloring algorithm can edge color a graph optimally. Indeed, their work, titled"the greedy algorithm is optimal for on-line edge coloring", shows that the competitive ratio of
Amin Saberi, David Wajc
openalex +2 more sources
Journal of Informatics and Computer Science (JINACS), 2020 Abstrak— Peningkatan kemajuan teknologi di Indonesia memberikan dampak yang cukup besar di berbagai bidang. Peningkatan kemajuan teknologi ini dimanfaatkan oleh manusia untuk menciptakan sebuah media yang dapat mengelola informasi dengan cepat dan akurat.
Celia Angelina Nogo Koban +1 more
openalex +3 more sources
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs [PDF]
ACM-SIAM Symposium on Discrete AlgorithmsVizing's theorem states that any graph of maximum degree $\Delta$ can be properly edge colored with at most $\Delta+1$ colors. In the online setting, it has been a matter of interest to find an algorithm that can properly edge color any graph on $n ...
Aditi Dudeja +2 more
semanticscholar +3 more sources
An Ultra-Wideband Handover System for GPS-Free Bridge Inspection Using Drones [PDF]
SensorsThis 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
A conditional greedy algorithm for edge-coloring [PDF]
, 2017 We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with $ ' > +1$ ($ '$ is the chromatic edge number and $ $ is the maximum vertex degree) would prove a long standing conjecture in edge-coloring of multigraphs.
Mark Goldberg
openalex +3 more sources
Random choices facilitate solutions to collective network coloring problems by artificial agents [PDF]
iScience, 2021 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
Iterated Greedy Graph Coloring and the Difficulty Landscape
Education and Research Archive, 1992 Technical report TR92-07. Many heuristic algorithms have been proposed for graph coloring. The simplest is perhaps the greedy algorithm. Many variations have been proposed for this algorithm at various levels of sophistication, but it is generally assumed that the coloring will occur in a single attempt.
Joseph Culberson
openalex +4 more sources
Graph Coloring on the Primary Dryland Forest Cover Map of Kalimantan Using the Greedy Algorithm
Journal of Mathematics Education and ScienceIn graph theory, graph coloring is a popular approach, including in map creation, and this study aims to apply the Greedy algorithm to color forest land-cover maps while ensuring that adjacent areas do not share the same color.
Izzaty Farha +4 more
openalex +3 more sources