{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":644734221,"defaultBranch":"main","name":"faster-max-cut","ownerLogin":"markolalovic","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-05-24T06:34:24.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/20873064?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1684910065.18783","currentOid":""},"activityList":{"items":[{"before":"8c627063d2156f92d32c0e8692913c68316fa15b","after":"e92e02073a89d62aabbfe9a6c278ba4d30e5a8b8","ref":"refs/heads/main","pushedAt":"2024-06-28T12:05:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"improved clarity and example","shortMessageHtmlLink":"improved clarity and example"}},{"before":"a013f3eadd18454a63ac364b0f21515ab598835e","after":"8c627063d2156f92d32c0e8692913c68316fa15b","ref":"refs/heads/main","pushedAt":"2024-06-03T08:59:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"citing","shortMessageHtmlLink":"citing"}},{"before":"32dbc412622020f1a59c86029e22db027669e388","after":"a013f3eadd18454a63ac364b0f21515ab598835e","ref":"refs/heads/main","pushedAt":"2024-05-29T09:49:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"removed redundant imports","shortMessageHtmlLink":"removed redundant imports"}},{"before":"3cda76f16d48b64b76eb8c4b5ff1d4ae33236128","after":"32dbc412622020f1a59c86029e22db027669e388","ref":"refs/heads/main","pushedAt":"2024-05-28T22:55:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"refining","shortMessageHtmlLink":"refining"}},{"before":"5854d1c9162d537e63622f2ae206596fce90aafb","after":"3cda76f16d48b64b76eb8c4b5ff1d4ae33236128","ref":"refs/heads/main","pushedAt":"2024-05-28T22:32:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"checked for correctness","shortMessageHtmlLink":"checked for correctness"}},{"before":"169b0231e562f7d460d634e8557223dcee75e03e","after":"5854d1c9162d537e63622f2ae206596fce90aafb","ref":"refs/heads/main","pushedAt":"2024-05-25T10:02:57.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"0fbb05b8fb27e595f5602cfe3a2403bf2e9725cd","after":"169b0231e562f7d460d634e8557223dcee75e03e","ref":"refs/heads/main","pushedAt":"2023-07-31T08:00:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"simplified branching algorithm for mc","shortMessageHtmlLink":"simplified branching algorithm for mc"}},{"before":"d938cc2eae6848d7dd07ae8e82d5b5faa848cb6d","after":"0fbb05b8fb27e595f5602cfe3a2403bf2e9725cd","ref":"refs/heads/main","pushedAt":"2023-07-30T16:14:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"added first (wannabe subexponential) branching algo","shortMessageHtmlLink":"added first (wannabe subexponential) branching algo"}},{"before":"9d5ef1339cb3deb285bc21827dcd206c6897564e","after":"d938cc2eae6848d7dd07ae8e82d5b5faa848cb6d","ref":"refs/heads/main","pushedAt":"2023-07-30T16:12:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"added first (wannabe subexponential) branching algo","shortMessageHtmlLink":"added first (wannabe subexponential) branching algo"}},{"before":"08ecdda7857ffb173359bd0e36f854cd0e74f106","after":"9d5ef1339cb3deb285bc21827dcd206c6897564e","ref":"refs/heads/main","pushedAt":"2023-07-14T14:20:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"debugged algo case 2 for double split graphs","shortMessageHtmlLink":"debugged algo case 2 for double split graphs"}},{"before":"592a06ab1b63680956d1ccd50ae898f1666d7a14","after":"08ecdda7857ffb173359bd0e36f854cd0e74f106","ref":"refs/heads/main","pushedAt":"2023-07-14T13:51:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"debugged algos for double split graphs","shortMessageHtmlLink":"debugged algos for double split graphs"}},{"before":"94badb44b2465c5eb05201c36f4464e9e35b1087","after":"592a06ab1b63680956d1ccd50ae898f1666d7a14","ref":"refs/heads/main","pushedAt":"2023-07-13T19:01:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"testing double split algos","shortMessageHtmlLink":"testing double split algos"}},{"before":"453a27b8258bd5db1cb3db44bf8eec15208aaada","after":"94badb44b2465c5eb05201c36f4464e9e35b1087","ref":"refs/heads/main","pushedAt":"2023-07-13T18:42:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"adding double split graph algos","shortMessageHtmlLink":"adding double split graph algos"}},{"before":"49540182958de9ee3d23a72bba410dafdb21a7f0","after":"453a27b8258bd5db1cb3db44bf8eec15208aaada","ref":"refs/heads/main","pushedAt":"2023-06-22T15:37:17.033Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"finished complexity of max-cut section","shortMessageHtmlLink":"finished complexity of max-cut section"}},{"before":"774708f3a61e6409cb55b3b688bdc8cddfda000c","after":"49540182958de9ee3d23a72bba410dafdb21a7f0","ref":"refs/heads/main","pushedAt":"2023-06-22T13:41:13.279Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"almost finished with np-completeness proof of complexity subsection","shortMessageHtmlLink":"almost finished with np-completeness proof of complexity subsection"}},{"before":"7fb88e82fb367087df3236c649341c13e5923cdd","after":"774708f3a61e6409cb55b3b688bdc8cddfda000c","ref":"refs/heads/main","pushedAt":"2023-06-22T09:49:07.263Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"adding complexity NP equivalence proof","shortMessageHtmlLink":"adding complexity NP equivalence proof"}},{"before":"21c79987785ac2bb6e90b189a13addd4e9d7d783","after":"7fb88e82fb367087df3236c649341c13e5923cdd","ref":"refs/heads/main","pushedAt":"2023-06-22T08:47:47.039Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"adding complexity NP equivalence proof","shortMessageHtmlLink":"adding complexity NP equivalence proof"}},{"before":"30e6d300362b08d968186036442dc045097ca88a","after":"21c79987785ac2bb6e90b189a13addd4e9d7d783","ref":"refs/heads/main","pushedAt":"2023-06-22T08:34:40.768Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"adding complexity NP equivalence proof","shortMessageHtmlLink":"adding complexity NP equivalence proof"}},{"before":"b00d41e9a9b20910e31503c5a116ca95fd7ba32f","after":"30e6d300362b08d968186036442dc045097ca88a","ref":"refs/heads/main","pushedAt":"2023-06-22T07:48:37.811Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"adding complexity NP equivalence proof","shortMessageHtmlLink":"adding complexity NP equivalence proof"}},{"before":"8a6043ce6248fab221958ab79ca28e04ecc292fd","after":"b00d41e9a9b20910e31503c5a116ca95fd7ba32f","ref":"refs/heads/main","pushedAt":"2023-06-15T19:38:03.202Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"finished with split graphs","shortMessageHtmlLink":"finished with split graphs"}},{"before":"d084b4191862615d5e9e484bda06a6a2f0b6d951","after":"8a6043ce6248fab221958ab79ca28e04ecc292fd","ref":"refs/heads/main","pushedAt":"2023-06-15T17:00:03.103Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"finished writing aux functions","shortMessageHtmlLink":"finished writing aux functions"}},{"before":"66973de2d763c69658587be2f9acb9fdd82f50eb","after":"d084b4191862615d5e9e484bda06a6a2f0b6d951","ref":"refs/heads/main","pushedAt":"2023-06-15T12:08:12.097Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"writing aux functions to algos","shortMessageHtmlLink":"writing aux functions to algos"}},{"before":"e61cfe25a633e0ca410eee80f0ff310664300be5","after":"66973de2d763c69658587be2f9acb9fdd82f50eb","ref":"refs/heads/main","pushedAt":"2023-06-15T09:18:33.115Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"writing aux functions to algos","shortMessageHtmlLink":"writing aux functions to algos"}},{"before":"b62f0556d50476714478db93d9650307706cce2c","after":"e61cfe25a633e0ca410eee80f0ff310664300be5","ref":"refs/heads/main","pushedAt":"2023-06-14T19:32:26.204Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"writing aux functions to algos","shortMessageHtmlLink":"writing aux functions to algos"}},{"before":"66a53d2e98c5e05d6132b26da56140691dd7de68","after":"b62f0556d50476714478db93d9650307706cce2c","ref":"refs/heads/main","pushedAt":"2023-06-14T16:12:24.887Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"writing aux functions to algos","shortMessageHtmlLink":"writing aux functions to algos"}},{"before":"f5213b0ac22f7ae6331fc33bedb8684c6626360e","after":"66a53d2e98c5e05d6132b26da56140691dd7de68","ref":"refs/heads/main","pushedAt":"2023-06-14T08:49:02.396Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"simplified the implementation of max cut for split graphs","shortMessageHtmlLink":"simplified the implementation of max cut for split graphs"}},{"before":"5ddc9216696b3fcedac8dcb392403df267352063","after":"f5213b0ac22f7ae6331fc33bedb8684c6626360e","ref":"refs/heads/main","pushedAt":"2023-06-14T08:47:42.394Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"simplified the implementation of max cut for split graphs","shortMessageHtmlLink":"simplified the implementation of max cut for split graphs"}},{"before":"85f5b7d432b032c50d0b5b3a6fa1622dccf43a01","after":"5ddc9216696b3fcedac8dcb392403df267352063","ref":"refs/heads/main","pushedAt":"2023-06-13T12:18:22.258Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"simplified table calculation","shortMessageHtmlLink":"simplified table calculation"}},{"before":"2596892d68928391c550d1aebbc52d05e7a2f4f9","after":"85f5b7d432b032c50d0b5b3a6fa1622dccf43a01","ref":"refs/heads/main","pushedAt":"2023-06-13T08:08:11.532Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"started with time complexity","shortMessageHtmlLink":"started with time complexity"}},{"before":"a62e10c74d289b2bedc67322b0a542dbaad468c4","after":"2596892d68928391c550d1aebbc52d05e7a2f4f9","ref":"refs/heads/main","pushedAt":"2023-06-12T11:39:49.223Z","pushType":"push","commitsCount":1,"pusher":{"login":"markolalovic","name":"Marko Lalovic","path":"/markolalovic","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/20873064?s=80&v=4"},"commit":{"message":"fixing lemmas and proof of correctness","shortMessageHtmlLink":"fixing lemmas and proof of correctness"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEcdIH-wA","startCursor":null,"endCursor":null}},"title":"Activity · markolalovic/faster-max-cut"}