Timeline for How many non-overlapping k-hop neighborhoods can be uniquely colored on an $N$-dimensional hypercube?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2012 at 12:57 | comment | added | StoicPorpoise | "Is there a known time complexity..." Actually, you just said the problem was open, didn't you? Sorry. | |
| Nov 6, 2012 at 12:45 | comment | added | StoicPorpoise | @Ben Barber Yeah, that's sort of what I thought. However, it would be great to have a reference explicitly stating that this is an open problem? Is there a known time complexity for the problem of finding the maximum number of non-overlapping subgraphs in the problem description? | |
| Nov 6, 2012 at 12:41 | comment | added | Ben Barber | Perhaps someone more familiar with codes can provide more specific recommendations for useful reading? | |
| Nov 6, 2012 at 12:40 | history | answered | Ben Barber | CC BY-SA 3.0 |