X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
defective-coloring (3) 3
legal-coloring (3) 3
algorithms (2) 2
coloring (2) 2
computer science, theory & methods (2) 2
distributed processing (2) 2
graph coloring (2) 2
iterative algorithms (2) 2
line-graphs (2) 2
05b45 (1) 1
05c15 (1) 1
52c22 (1) 1
ad-hoc networks (1) 1
chromatic number (1) 1
clique number (1) 1
computation (1) 1
computer communication networks (1) 1
computer hardware (1) 1
computer networks (1) 1
computer science (1) 1
computer science, artificial intelligence (1) 1
computer systems organization and communication networks (1) 1
distributed algorithms (1) 1
electronic computers. computer science (1) 1
graph (1) 1
graphs (1) 1
greedy coloring (1) 1
heuristic (1) 1
learning automata (1) 1
legal coloring (1) 1
local search (1) 1
mathematics, applied (1) 1
maximum clique legal coloring of the nodes (1) 1
number (1) 1
optimization (1) 1
parallel algorithm (1) 1
running (1) 1
set (1) 1
software engineering/programming and operating systems (1) 1
theory of computation (1) 1
vertex coloring (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


SIAM Journal on Computing, ISSN 0097-5397, 2014, Volume 43, Issue 1, pp. 72 - 95
The distributed (Delta + 1)-coloring problem is one of the most fundamental and well-studied problems in distributed algorithms. Starting with the work of Cole... 
Defective-coloring | Legal-coloring | Distributed algorithms | MATHEMATICS, APPLIED | SET | defective-coloring | PARALLEL ALGORITHM | distributed algorithms | COMPUTER SCIENCE, THEORY & METHODS | legal-coloring | Coloring | Distributed processing | Algorithms | Graph coloring | Computation | Running | Iterative algorithms | Heuristic
Journal Article
Acta Universitatis Sapientiae, Informatica, ISSN 2066-7760, 12/2018, Volume 10, Issue 2, pp. 137 - 157
It is a common practice to find upper bound for clique number via legal coloring of the nodes of the graph. We will point out that with a little extra work we... 
05B45 | 52C22 | maximum clique legal coloring of the nodes | chromatic number | clique number | greedy coloring | 05C15
Journal Article
Distributed Computing, ISSN 0178-2770, 10/2013, Volume 26, Issue 5, pp. 273 - 287
Journal Article
Computing and Informatics, ISSN 1335-9150, 2010, Volume 29, Issue 3, pp. 447 - 466
In this paper, we propose a learning automata-based iterative algorithm for approximating a near optimal solution to the vertex coloring problem. Vertex... 
learning automata | GRAPH | NUMBER | Graph coloring | legal coloring | AD-HOC NETWORKS | LOCAL SEARCH | OPTIMIZATION | vertex coloring | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | iterative algorithms
Journal Article
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, 06/2011, pp. 129 - 138
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently,... 
defective-coloring | line-graphs | legal-coloring
Conference Proceeding
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.