Timeline for Cycle of length 4 in an undirected graph
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2017 at 10:55 | comment | added | Vijayender | Elegant, but dot product is O(n). But I guess this problem is from DasGupta Algorithms, where in we are asked to assume the format to be matrix or adjacency list whichever is easier for evaluation. Looping in pairs is O(n^2) and each dot product is O(n). Hence O(n^2 x n) | |
| Jun 17, 2011 at 5:33 | comment | added | Gerry Myerson | @Barry, welcome to MO! | |
| Jun 17, 2011 at 1:01 | history | answered | Barry Cipra | CC BY-SA 3.0 |