Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with colorings
Search options not deleted
user 46266
Questions on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
1
vote
1
answer
25
views
Current state of polynomial-space exact graph coloring
The fastest algorithm I could find that finds the chromatic number of an undirected simple graph exactly in only polynomial-space is "Faster Graph Coloring in Polynomial Space" by Gaspers and Lee (DOI …
- 201
1
vote
1
answer
138
views
Fastest way to find optimal graph coloring in polynomial space given chromatic number
question is not a duplicate, contrary to what the title may suggest: Using the chromatic number to compute an optimal coloring
This is not a homework question, I just want to write a program finding optimal colorings …
- 201
2
votes
1
answer
123
views
Tight approximation for the chromatic number of an arbitrary graph in polynomial space and time
I am looking for an algorithm for approximating the chromatic number of an undirected simple graph with $n$ vertices in $O(n^{c_1})$ time and $O(n^{c_2})$ space, for some constants $c_1$ and $c_2$. Mo …
- 201