Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,979,203 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.
2017
2017
Cost-efficient secondary users grouping for two-tier cognitive radio networks
Yousef N. Shnaiwer
,
S. Zummo
,
W. Mesbah
,
Saad Al-Ahmadi
Physical Communication
2017
Corpus ID: 30488090
2016
2016
Scalable Non-Orthogonal Pilot Design for Massive MIMO Systems with Massive Connectivity
Ruichen Deng
,
Sheng Zhou
,
Z. Niu
IEEE Globecom Workshops (GC Wkshps)
2016
Corpus ID: 29613035
With the growing need for Internet of things (IoT) applications, wireless communications are facing the challenge of providing…
Expand
2014
2014
Fast Triangle Core Decomposition for Mining Large Graphs
Ryan A. Rossi
Pacific-Asia Conference on Knowledge Discovery…
2014
Corpus ID: 31969676
Large triangle cores represent dense subgraphs for which each edge has at least k − 2 triangles (same as cliques). This paper…
Expand
2010
2010
Time Slot Assignment Algorithms in IEEE 802.16 Multi-hop Relay Networks
Rintaro Ishii
,
G. Hasegawa
,
Y. Taniguchi
,
H. Nakano
Sixth International Conference on Networking and…
2010
Corpus ID: 7505748
In this paper, we propose an assignment algorithm of time slots for wireless links in IEEE 802.16 multi-hop relay networks. The…
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
2010
2010
Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links
B. Mumey
,
Jian Tang
,
Timothy Hahn
IEEE International Conference on Communications
2010
Corpus ID: 10072212
MIMO links enable concurrent transmissions of multiple independent data streams between a pair of nodes, which can significantly…
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
2006
2006
Greedy defining sets in graphs and Latin squares
M. Zaker
Electron. Notes Discret. Math.
2006
Corpus ID: 7689835
2005
2005
Mobile agent based TDMA slot assignment algorithm for wireless sensor networks
R. Patro
,
B. Mohan
International Conference on Information…
2005
Corpus ID: 715136
In this paper we propose an on-line TDMA slot assignment/graph coloring algorithm for wireless sensor networks with the help of a…
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE