Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,149,139 papers from all fields of science
Search
Sign In
Create Free Account
Greedy coloring
In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Albertson conjecture
András Hajnal
Brooks' theorem
Claw-free graph
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Hierarchical Colorings of Cographs
Dulce I. Valdivia
,
Manuela Geiß
,
M. Hellmuth
,
M. Hernández-Rosales
,
P. Stadler
arXiv.org
2019
Corpus ID: 195345410
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph…
Expand
2017
2017
PENERAPAN METODE GREEDY COLORING DALAM MENYELESAIKAN MASALAH PERSIMPANGAN JALAN
Faisal Piliang
2017
Corpus ID: 125463405
Greedy method is one of the ways or techniques to design an algorithm that is widely used to find optimal solutions of a problem…
Expand
2013
2013
TEKNIK MENENTUKAN PERJALANAN PADA MASALAH PERSIMPANGAN DENGAN MENGGUNAKAN METODE GREEDY COLORING
Faisal Piliang
2013
Corpus ID: 117037164
Metode Greedy adalah salah satu cara atau teknik merancang suatu algoritma. Metode Greedy digunakan untuk mendapatkan solusi…
Expand
2011
2011
TOPOLOGY ANALYSIS NETWORK SERVER USING GREEDY COLORING METHOD ON PT. DIGITAL WIRELESS INDONESIA
Tubagus Arief Rachman
2011
Corpus ID: 110320779
Utilization of computer network needs to see the existing network topology. For future development of Internet services to users…
Expand
2010
2010
On some upper bounds on the fractional chromatic number of weighted graphs
Ashwin Ganesan
arXiv.org
2010
Corpus ID: 7575939
Given a weighted graph $G_\bx$, where $(x(v): v \in V)$ is a non-negative, real-valued weight assigned to the vertices of G, let…
Expand
2010
2010
Scheduling for MIMO Networks with Rate-Constrained Connectivity Requirements
F. Jiang
,
Jianqi Wang
,
A. L. Swindlehurst
IEEE Vehicular Technology Conference
2010
Corpus ID: 16819509
In this paper, we present a novel definition of connectivity for ad hoc networks, and based on this definition, we propose a…
Expand
2007
2007
Randomly Colorable Graphs in Greedy Coloring
L. Sai
2007
Corpus ID: 123749583
Greedy algorithm is a simple approximative method in graph coloring.By greedy algorithm,a graph which was obtained from G by…
Expand
2007
2007
Coloring Rooted Subtrees on a Bounded Degree Host Tree
Anuj Rawat
,
M. Shayman
,
R. La
,
S. Marcus
2007
Corpus ID: 14482975
We consider a rooted tree R to be a rooted subtree of a given tree T if the tree obtained by replacing the directed arcs of R by…
Expand
Review
1998
Review
1998
Scalable and Multilevel Iterative Methods
W. Wan
1998
Corpus ID: 13901978
OF THE DISSERTATION Scalable and Multilevel Iterative Methods by Wing Lok Wan Doctor of Philosophy in Mathematics University of…
Expand
1995
1995
A Passage Time for Greedy-Coloring Cycles
J. Preater
Random Struct. Algorithms
1995
Corpus ID: 3216055
We consider the progress of the greedy vertex coloring algorithm applied to cycle graphs. In particular we study the asymptotic…
Expand