Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,201,877 papers from all fields of science
Search
Sign In
Create Free Account
Graph coloring
Known as:
Graph coloring algorithm
, Mycielski's theorem
, K-coloring
Expand
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
B-coloring
Branch and bound
Branch and price
Breadth-first search
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Distributed Algorithms for Approximating Wireless Network Capacity
M. Dinitz
Proceedings IEEE INFOCOM
2010
Corpus ID: 11366805
In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol…
Expand
Highly Cited
2009
Highly Cited
2009
Dacota: Post-silicon validation of the memory subsystem in multi-core designs
Andrew DeOrio
,
Ilya Wagner
,
V. Bertacco
IEEE 15th International Symposium on High…
2009
Corpus ID: 7838277
The number of functional errors escaping design verification and being released into final silicon is growing, due to the…
Expand
Highly Cited
2008
Highly Cited
2008
Creating the Color Panoramic View using Medley of Grayscale and Color Partial Images
H. B. Kekre
,
Sudeep D. Thepade
2008
Corpus ID: 17636400
— Panoramic view generation ha s always offered novel and distinct challenges in the field of image processing. Panoramic view…
Expand
2004
2004
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
S. Parthasarathy
,
R. Gandhi
2004
Corpus ID: 16753570
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the…
Expand
2001
2001
Ants and Graph Coloring
J. Shawe-Taylor
,
J. Žerovnik
2001
Corpus ID: 13274860
Ants algorithm is an evolutionary search method for solving combinatorial optimization problems. In this note we propose a…
Expand
Highly Cited
1997
Highly Cited
1997
Deterministic Many-to-Many Hot Potato Routing
A. Borodin
,
Y. Rabani
,
B. Schieber
IEEE Trans. Parallel Distributed Syst.
1997
Corpus ID: 5721764
We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing, a packet cannot be buffered, and…
Expand
Review
1994
Review
1994
Some Reflections On The Interference Channel
E. Meulen
1994
Corpus ID: 61100826
This paper provides a short overview of the advances on the interference channel, which is a well-known channel in multiuser…
Expand
1993
1993
Selector table indexing & sparse arrays
K. Driesen
Conference on Object-Oriented Programming Systems…
1993
Corpus ID: 2028725
Selector table indexing is a simple technique for method lookup in object-oriented languages, which yields good performance, is…
Expand
Review
1989
Review
1989
Heuristics for graph coloring
D. Werra
1989
Corpus ID: 118224077
Heuristics for Graph Coloring. Some sequential coloring techniques are reviewed. A few general principles for designing…
Expand
Review
1987
Review
1987
Fitting Cosines: Some Procedures and Some Physical Examples
D. Brillinger
1987
Corpus ID: 115697293
The paper is concerned with a variety of time series models that in some sense lead to the fitting of a cosine function of…
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