Results 251 to 260 of about 129,100 (297)

The greedy algorithm is optimal for on-line edge coloring

Information Processing Letters, 1992
In this note we are concerned with on-line edge coloring. We show that the greedy algorithm, which has performance ratio 2, is optimal in both the deterministic and the randomized case. In both cases, we define a graph such that any on-line algorithm must use \(2\Delta-1\) colors, independent of whether the graph is given edge-by-edge or vertex-by ...
Bar-Noy, Amotz, Motwani, Rajeev, Naor, Joseph   +2 more
openaire   +2 more sources

A practical approach for map coloring considering of greedy algorithm

2010 The 2nd Conference on Environmental Science and Information Application Technology, 2010
The goal of a map coloring problem is to color a map so that regions sharing a common border have different colors, map-coloring problem is a classic NP-complete graph optimization problem, which has many real-world applications. From analyzing the characters of greedy algorithm, we proposed a new map coloring approach, which includes sorting the ...
null Lingli Zhao, null Shuai Liu, null Junsheng Li, null Haichen Xu, null Hao Chen   +4 more
openaire   +1 more source

An optimal greedy heuristic to color interval graphs

Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Online Edge Coloring: Sharp Thresholds

arXiv.org
Vizing's theorem guarantees that every graph with maximum degree $\Delta$ admits an edge coloring using $\Delta + 1$ colors. In online settings - where edges arrive one at a time and must be colored immediately - a simple greedy algorithm uses at most $2\
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc   +3 more
semanticscholar   +1 more source

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring

arXiv.org
We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $\Delta$. The first is a simple algorithm that extends the idea of Morris and Song to color graphs with maximum degree $\Delta$ using $\Delta+1$ colors ...
Asaf Ferber, Liam Hardiman, Xiaonan Chen
semanticscholar   +1 more source

An Effective Algorithm for Edge Coloring: Malatya Edge Coloring Algorithm

Turkish journal of science and technology
In this research, an algorithm offering effective and robust solutions for the edge coloring problem in graph theory is proposed. The edge coloring problem is identified as an NP-hard problem, known for its extensive resolution time and inability to be ...
Furkan Öztemiz
semanticscholar   +1 more source

Towards Optimal Distributed Edge Coloring with Fewer Colors

International Symposium on Distributed Computing
There is a huge difference in techniques and runtimes of distributed algorithms for problems that can be solved by a sequential greedy algorithm and those that cannot. A prime example of this contrast appears in the edge coloring problem: while $(2\Delta-
Manuel Jakob, Yannic Maus, Florian Schager   +2 more
semanticscholar   +1 more source

DETERMINING THE CHROMATIC NUMBER OF A MODIFIED ADENOVIRUS GRAPH USING GREEDY ALGORITHM

Journal of Mathematical Sciences and Optimization
One of the vertex colorings that is a well-known research topic is chromatic number which requires that any two adjacent vertices have different colors.
Aulia Azzahra Amran, Susilawati
semanticscholar   +1 more source

Graph Coloring for Multi-Task Learning

arXiv.org
When different objectives conflict with each other in multi-task learning, gradients begin to interfere and slow convergence, thereby potentially reducing the final model's performance.
Santosh Patapati, Trisanth Srinivasan
semanticscholar   +1 more source

Research on Coloring Theory and Greedy Method Based Automated Examination Arrangement Algorithm

2009 International Workshop on Intelligent Systems and Applications, 2009
Aiming at existing examination arrangement algorithm lacks of application value due to its too ideal conditions, this paper presents a improved algorithm based on coloring theory and greedy method, which realize automated examination arrangement by allocating resources such as examination time and classrooms by stages.
Ouyang Yong, Li Han
openaire   +1 more source