StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

chesslover

Rating
1499.48 (3,780,203rd)

Reputation
371 (347,078th)

Page: 1

Title	Δ
Coloring a graph using Depth first traversal	0.00
Quickest way to get the position of the leading 1 in a bitset for a...	-0.52
How to find the size of maximal clique or clique number?	0.00
Flaw in this maximum clique polynomial time approach?	0.00
Brelaz minimun colouring	0.00
Can we solve N Queens without backtracking? and How to calculate an...	0.00
minimum graph coloring using backtracking	0.00
Is there a graph coloring algorithm where limits can be placed on n...	0.00
Create a dynamic bitset in standard C++?	0.00
Which bitset implementation should I use for maximum performance?	0.00
Is the use of std::vector<bool> objects in C++ acceptable, or...	0.00
How to implement a bitset in C?	0.00
bitscan (bsf) on std::bitset ? Or similar	0.00
Bit Array in C++	0.00
clique number of a graph	0.00
N-Queens ProbIem..How far can we go?	0.00