Timeline for Counting simple 4-cycles in an undirected graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2014 at 23:47 | comment | added | Brendan McKay | Also called holes of length 4. | |
| Jan 19, 2014 at 23:36 | comment | added | David Eppstein | Btw, those would usually be called induced 4-cycles. | |
| Jan 19, 2014 at 10:49 | comment | added | Dree | Thank you, your algorithm works fine and in a very reasonable time. The only problem is that I realize I only need to count true 4-cycles, which we can see them to be isomorphic to empty squares. In other words, I have to count 4-cycles where the two opposite vertices are not connected. Is there a way to modify your algorithm to respect this constraint? | |
| Jan 19, 2014 at 5:58 | history | answered | Brendan McKay | CC BY-SA 3.0 |