Timeline for Graph Canonization & "set of isomorphism"
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2011 at 13:46 | vote | accept | user15090 | ||
| May 14, 2011 at 13:46 | |||||
| May 14, 2011 at 13:45 | vote | accept | user15090 | ||
| May 14, 2011 at 13:46 | |||||
| May 14, 2011 at 6:32 | comment | added | Gerhard Paseman | I know that I have not directly addressed the question of representation, which may mean using things like lexicographic ordering of blocks. However, I think the abstraction for graphs is the important point to communicate, and that something like "S is an edge in hypergraph A iff f{S} is an edge in hypergraph B" should be internalized before writing code to implement such a test, or answering questions about such implementations. Gerhard "Ask Me About System Design" Paseman, 2011.05.13 | |
| May 14, 2011 at 6:25 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |