Timeline for Counting simple 4-cycles in an undirected graph [closed]
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2014 at 11:23 | review | Reopen votes | |||
| Jan 20, 2014 at 2:33 | |||||
| Jan 19, 2014 at 11:04 | history | edited | Dree | CC BY-SA 3.0 |
added 175 characters in body
|
| Jan 19, 2014 at 7:47 | history | closed |
Dima Pasechnik Brendan McKay Ricardo Andrade Daniel Moskovich Ryan Budney |
Not suitable for this site | |
| Jan 19, 2014 at 5:58 | answer | added | Brendan McKay | timeline score: 3 | |
| Jan 19, 2014 at 4:06 | answer | added | David Eppstein | timeline score: 3 | |
| Jan 19, 2014 at 4:03 | answer | added | Igor Rivin | timeline score: 0 | |
| Jan 18, 2014 at 22:44 | review | Close votes | |||
| Jan 19, 2014 at 7:47 | |||||
| Jan 18, 2014 at 20:42 | answer | added | Igor Rivin | timeline score: 2 | |
| Jan 18, 2014 at 20:32 | comment | added | Alex Degtyarev | You should be more specific on how non-optimal it can be. The stupidest algorithm is to list all quadruples of edges and count those that are cycles. | |
| Jan 18, 2014 at 19:43 | review | First posts | |||
| Jan 18, 2014 at 19:51 | |||||
| Jan 18, 2014 at 19:26 | history | asked | Dree | CC BY-SA 3.0 |