Greedy Coloring is a graph coloring algorithm that belongs to the class of sequential vertex coloring methods, distinguished by its strategy of assigning to each vertex the smallest available color not used by its already-colored neighbors, processed in a predetermined order.
49
Publications
2.3K
Citations
125
Authors
69
Institutions
Publications per year
2017–2026
4
Parents
Publications
49
Four classes of perfectly orderable graphs
Vašek Chvátal, Chı́nh T. Hoàng, N. V. R. Mahadev et al. · Journal of Graph Theory · 1987 · 127 citations
On frame-based scheduling for directional mmWave WPANs
In Keun Son, Shiwen Mao, Michelle X. Gong et al. · 2012 · 123 citations
1–5 of 49
Authors
125
- MM
4
h-index
- GA
3
h-index
- RS
2
h-index
- JN
2
h-index
- AB
2
h-index
1–5 of 125
Institutions
69
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
6 publications
173 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
7 publications
619 citations
University of Iceland
Reykjavik, Iceland
3 h-index
4 publications
79 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
3 publications
169 citations
Arizona State University
Tempe, United States
2 h-index
3 publications
220 citations
Qualcomm (United Kingdom)
Farnborough, United Kingdom
2 h-index
2 publications
35 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
3 publications
342 citations
Old Dominion University
Norfolk, United States
2 h-index
2 publications
221 citations
1–8 of 69
Venues
- SIAM Journal on Discrete Mathematics
4 publications · 201 citations
4
h-index
- Computers & Operations Research
4 publications · 380 citations
4
h-index
- Journal of Graph Theory
3 publications · 168 citations
3
h-index
- Discrete Mathematics
3 publications · 106 citations
3
h-index
- Information Processing Letters
3 publications · 240 citations
3
h-index
1–5