| e9c1f42 | Enna Gerhard | 01 June 2022, 16:20:07 UTC | Add information in readme | 01 June 2022, 16:20:07 UTC |
| 5eee499 | Enna Gerhard | 20 May 2022, 14:31:05 UTC | Attempt integrating mce solver | 20 May 2022, 14:31:05 UTC |
| 7f7d0b7 | Darren Strash | 23 October 2018, 15:40:40 UTC | Re-add accidentally deleted data files | 23 October 2018, 15:40:40 UTC |
| e320472 | Darren Strash | 29 December 2017, 13:56:33 UTC | add makefile to rules | 29 December 2017, 13:56:33 UTC |
| ddc8e27 | Darren Strash | 29 December 2017, 13:16:26 UTC | disable clique printing flag | 29 December 2017, 13:16:26 UTC |
| f6adf18 | Darren Strash | 29 December 2017, 13:15:17 UTC | Don't print space at end of line. Offset vertex ids if reading file format with one-based ids. | 29 December 2017, 13:15:17 UTC |
| 85a015a | Darren Strash | 13 July 2017, 00:06:53 UTC | Put build status in README | 13 July 2017, 00:06:53 UTC |
| fafc29c | Darren Strash | 12 July 2017, 23:57:23 UTC | Travis CI integration, try 4 | 12 July 2017, 23:57:23 UTC |
| 4d9e6ae | Darren Strash | 12 July 2017, 23:56:00 UTC | Travis CI integration, try 2 | 12 July 2017, 23:56:00 UTC |
| 786fdeb | Darren Strash | 12 July 2017, 23:53:09 UTC | Travis CI integration, try 2 | 12 July 2017, 23:53:09 UTC |
| 34f2a2d | Darren Strash | 12 July 2017, 23:47:42 UTC | Travis CI integration, try 1 | 12 July 2017, 23:47:42 UTC |
| f7cc791 | Darren Strash | 04 August 2016, 13:22:11 UTC | Re-layout publication information | 04 August 2016, 13:22:11 UTC |
| b3a9b9f | Darren Strash | 04 August 2016, 13:19:06 UTC | Instructions for printing cliques | 04 August 2016, 13:19:06 UTC |
| 81eea52 | Darren Strash | 04 August 2016, 13:00:56 UTC | Move code unrelated to clique listing | 04 August 2016, 13:00:56 UTC |
| c0fcab5 | Darren Strash | 04 August 2016, 12:17:34 UTC | Give options for algorithm name | 04 August 2016, 12:17:34 UTC |
| 5d7a92a | Darren Strash | 04 August 2016, 12:16:22 UTC | Fix error in README | 04 August 2016, 12:16:22 UTC |
| f3a9c59 | Darren Strash | 04 August 2016, 12:15:26 UTC | Fix error in README | 04 August 2016, 12:15:26 UTC |
| 41414e2 | Darren Strash | 04 August 2016, 12:13:03 UTC | Improve README formatting | 04 August 2016, 12:13:03 UTC |
| d79d7be | Darren Strash | 04 August 2016, 12:10:14 UTC | Update README to include graph formats. | 04 August 2016, 12:10:14 UTC |
| 2c44962 | Darren Strash | 04 August 2016, 12:00:55 UTC | Add graph format description | 04 August 2016, 12:00:55 UTC |
| 1dffeb9 | Darren Strash | 28 June 2016, 13:40:49 UTC | Fix spurious print error | 28 June 2016, 13:40:49 UTC |
| d3686ca | Darren Strash | 17 March 2016, 13:23:52 UTC | Add experiment to find and print maximum clique | 17 March 2016, 13:23:52 UTC |
| bbd935e | Darren Strash | 17 March 2016, 11:33:49 UTC | Code for loading partitions, and for running on sparse graphs. | 17 March 2016, 11:33:49 UTC |
| 7f49e24 | Darren Strash | 03 March 2016, 14:59:07 UTC | Add include headers for gcc | 03 March 2016, 14:59:07 UTC |
| 8e19357 | Darren Strash | 03 March 2016, 14:54:58 UTC | Fix divide by two error, MCIS algorithms no longer attempt a second round | 03 March 2016, 14:54:58 UTC |
| 820d415 | Darren Strash | 03 March 2016, 11:43:05 UTC | Fix maximum critical set implementation? | 03 March 2016, 11:43:05 UTC |
| 2f19ffe | Darren Strash | 02 March 2016, 10:25:16 UTC | Optimize rounds of matching | 02 March 2016, 10:25:16 UTC |
| 334f795 | Darren Strash | 02 March 2016, 09:47:45 UTC | Finished optimizing matching with vertex sets. Now for multi-round matching. | 02 March 2016, 09:47:45 UTC |
| 157a945 | Darren Strash | 02 March 2016, 08:55:21 UTC | Prepare for test-driven development of optimized repeated matching | 02 March 2016, 08:55:21 UTC |
| 0f9c90f | Darren Strash | 02 March 2016, 08:11:00 UTC | Finish optimizing one-time matching | 02 March 2016, 08:11:00 UTC |
| 1594f01 | Darren Strash | 01 March 2016, 15:50:29 UTC | Some minor optimizations | 01 March 2016, 15:50:29 UTC |
| 128c74a | Darren Strash | 01 March 2016, 15:13:51 UTC | Refactor matching code, put check and timers for test-driven development | 01 March 2016, 15:13:51 UTC |
| 11b3012 | Darren Strash | 01 March 2016, 14:08:53 UTC | Start development on faster bipartite matching | 01 March 2016, 14:08:53 UTC |
| 6057776 | Darren Strash | 25 February 2016, 21:15:22 UTC | New experiment to run on components without kernelizing first | 25 February 2016, 21:15:22 UTC |
| 1a48866 | Darren Strash | 20 February 2016, 12:36:13 UTC | Change position of timers to more closely match competetors | 20 February 2016, 12:36:13 UTC |
| 031c527 | Darren Strash | 19 February 2016, 22:00:09 UTC | Simplify code further | 19 February 2016, 22:00:09 UTC |
| d0b24b9 | Darren Strash | 19 February 2016, 21:03:48 UTC | use bitvector | 19 February 2016, 21:03:48 UTC |
| 370c709 | Darren Strash | 19 February 2016, 20:11:46 UTC | Improve reductions. New class for test-driven development | 19 February 2016, 20:11:46 UTC |
| 614452b | Darren Strash | 19 February 2016, 09:37:57 UTC | Small changes to enable postprocessing of experimental data | 19 February 2016, 09:37:57 UTC |
| ba865e9 | Darren Strash | 18 February 2016, 12:35:36 UTC | convert edges to snap format | 18 February 2016, 12:35:36 UTC |
| 5ed0135 | Darren Strash | 16 February 2016, 23:16:00 UTC | Put independent set size in table for max-critical-set-kernel experiment | 16 February 2016, 23:16:00 UTC |
| 73676eb | Darren Strash | 16 February 2016, 22:52:19 UTC | Implement Larson's maximum critical independent set algorithm. | 16 February 2016, 22:52:19 UTC |
| 7bf0dd7 | Darren Strash | 16 February 2016, 12:40:20 UTC | Remove debug output | 16 February 2016, 12:40:20 UTC |
| 76dbcd7 | Darren Strash | 16 February 2016, 12:33:23 UTC | Critical set kernelization experiment | 16 February 2016, 12:33:23 UTC |
| 0726293 | Darren Strash | 15 February 2016, 21:29:14 UTC | Working critical set implementation | 15 February 2016, 21:29:14 UTC |
| a0ac60a | Darren Strash | 11 February 2016, 07:38:20 UTC | MISS experiments | 11 February 2016, 07:38:20 UTC |
| e1dbbd5 | Darren Strash | 10 February 2016, 10:26:58 UTC | New experiments for MIS | 10 February 2016, 10:26:58 UTC |
| 9e9f4da | Darren Strash | 09 February 2016, 14:51:46 UTC | Add timing to kernel size experiment | 09 February 2016, 14:51:46 UTC |
| 7b14ae6 | Darren Strash | 08 February 2016, 10:23:50 UTC | remove image | 08 February 2016, 10:23:50 UTC |
| d31454f | Darren Strash | 08 February 2016, 10:22:57 UTC | align image | 08 February 2016, 10:22:57 UTC |
| 6cfda59 | Darren Strash | 08 February 2016, 10:18:35 UTC | Fix broken image | 08 February 2016, 10:18:35 UTC |
| bf809ca | Darren Strash | 08 February 2016, 10:16:07 UTC | Image | 08 February 2016, 10:16:07 UTC |
| b2e07fc | Darren Strash | 08 February 2016, 10:02:55 UTC | remove readme text, use markdown instead on GitHub, remove comment from test script. | 08 February 2016, 10:02:55 UTC |
| 5436908 | Darren Strash | 08 February 2016, 09:30:24 UTC | Put readme into markdown | 08 February 2016, 09:30:24 UTC |
| e434ab8 | Darren Strash | 19 January 2016, 10:22:22 UTC | Remove fixed compiler version | 19 January 2016, 10:22:22 UTC |
| 6f32333 | Darren Strash | 19 January 2016, 10:21:22 UTC | Make compile with g++ 5, fix RETURN_CLIQUES_ONE_BY_ONE. Listing algorithms now use callback. | 19 January 2016, 10:21:22 UTC |
| a989d2c | Darren Strash | 09 December 2015, 14:54:53 UTC | Remove checks | 09 December 2015, 14:54:53 UTC |
| 182e89a | Darren Strash | 13 April 2015, 08:08:58 UTC | basic recursive binary search | 13 April 2015, 08:08:58 UTC |
| 4972bda | Darren Strash | 11 April 2015, 16:57:53 UTC | Forward search starts where standard search would end. use MISR ordering before next level of recursion. | 11 April 2015, 16:57:53 UTC |
| 51b85d5 | Darren Strash | 11 April 2015, 13:01:28 UTC | Can do MISR ordering with isolates class | 11 April 2015, 13:01:28 UTC |
| 5a21f4a | Darren Strash | 10 April 2015, 22:02:54 UTC | Basic forward search method. No binary search, no multi-level. | 10 April 2015, 22:02:54 UTC |
| 95a3562 | Darren Strash | 10 April 2015, 18:34:36 UTC | A working algorithm that scans forward at each level of recursion. | 10 April 2015, 18:34:36 UTC |
| a72d072 | Darren Strash | 10 April 2015, 17:46:19 UTC | some code cleanup | 10 April 2015, 17:46:19 UTC |
| 67a5c94 | Darren Strash | 10 April 2015, 14:51:42 UTC | Move methods from MISQ to forward search. | 10 April 2015, 14:51:42 UTC |
| 9117afe | Darren Strash | 10 April 2015, 14:41:53 UTC | Initial files for forward search approximation algorithm | 10 April 2015, 14:41:53 UTC |
| df4f863 | Darren Strash | 10 April 2015, 14:00:21 UTC | Reduce memory for forward-search experiment | 10 April 2015, 14:00:21 UTC |
| bd7585d | Darren Strash | 10 April 2015, 13:48:16 UTC | Remove debug statements | 10 April 2015, 13:48:16 UTC |
| 2b99d14 | Darren Strash | 10 April 2015, 08:34:18 UTC | Vastly faster initial MISR ordering. | 10 April 2015, 08:34:18 UTC |
| 67cfd92 | Darren Strash | 10 April 2015, 07:40:12 UTC | Ability to run experiments and put in table. | 10 April 2015, 07:40:12 UTC |
| 9f190ca | Darren Strash | 09 April 2015, 10:39:22 UTC | Remove some debug statements. Provide new subgraph print method. | 09 April 2015, 10:39:22 UTC |
| f806434 | Darren Strash | 01 April 2015, 13:41:52 UTC | Support for all implemented reductions | 01 April 2015, 13:41:52 UTC |
| 99cbda5 | Darren Strash | 01 April 2015, 12:08:33 UTC | Simple undoing of reduction. | 01 April 2015, 12:08:33 UTC |
| 4d71b4b | Darren Strash | 01 April 2015, 08:12:12 UTC | Test vertex folding and domination reductions. Use domination reduction in recursion | 01 April 2015, 08:12:12 UTC |
| 4690d01 | Darren Strash | 10 March 2015, 12:45:49 UTC | Experiment with removing independent set and neighbors in beginning of algorithm | 10 March 2015, 12:45:49 UTC |
| 02e89ad | Darren Strash | 05 March 2015, 08:34:04 UTC | Basic (sort of wrong and slow) 3-level elimination of huge swaths of graph | 05 March 2015, 08:34:04 UTC |
| d4d872e | Darren Strash | 03 March 2015, 13:35:39 UTC | Basic critical independent set finding | 03 March 2015, 13:35:39 UTC |
| d5ddf5e | Darren Strash | 02 March 2015, 09:02:08 UTC | Non-working versions of vertex cover finding in bi-double graphs | 02 March 2015, 09:02:08 UTC |
| b815c9f | Darren Strash | 25 February 2015, 15:40:32 UTC | Fastest current reduction algorithm yeast.786=31s, mann45=0.3s | 25 February 2015, 15:40:32 UTC |
| 6ea0543 | Darren Strash | 23 February 2015, 17:32:58 UTC | Preprocess to speed up yeast.955 computation | 23 February 2015, 17:32:58 UTC |
| 0b72792 | Darren Strash | 23 February 2015, 09:40:08 UTC | Working coloring in connected components algorithm | 23 February 2015, 09:40:08 UTC |
| 17bf17f | Darren Strash | 23 February 2015, 09:06:54 UTC | Fix bug in MISR ordering for isolates | 23 February 2015, 09:06:54 UTC |
| 2885cf5 | Darren Strash | 23 February 2015, 08:30:24 UTC | More changes for basic connected components algorithm | 23 February 2015, 08:30:24 UTC |
| 8355f6d | Darren Strash | 22 February 2015, 18:43:31 UTC | Move components computation to method | 22 February 2015, 18:43:31 UTC |
| a170858 | Darren Strash | 22 February 2015, 17:26:16 UTC | Basic coloring for connected components | 22 February 2015, 17:26:16 UTC |
| df275e0 | Darren Strash | 22 February 2015, 12:46:41 UTC | Prototype two-level connected component algorithm | 22 February 2015, 12:46:41 UTC |
| cf3bafe | Darren Strash | 21 February 2015, 20:38:48 UTC | Working (but slow) version of 1-level connected-components separation with reductions | 21 February 2015, 20:38:48 UTC |
| c496460 | Darren Strash | 19 February 2015, 15:03:17 UTC | Basic domination removal | 19 February 2015, 15:03:17 UTC |
| b21a15c | Darren Strash | 19 February 2015, 09:47:50 UTC | framework for comparison algorithms running on search spaces, algorithm for testing new ideas. | 19 February 2015, 09:47:50 UTC |
| cf4ff29 | Darren Strash | 16 February 2015, 15:40:36 UTC | Faster independent set coloring for sparse graphs | 16 February 2015, 15:40:36 UTC |
| 016e05e | Darren Strash | 16 February 2015, 13:54:24 UTC | include <algorithm>; get sparse independent set coloring strategy working | 16 February 2015, 13:54:24 UTC |
| fd78b32 | Darren Strash | 16 February 2015, 08:57:21 UTC | new tool to convert to .graph format. | 16 February 2015, 08:57:21 UTC |
| 7224757 | Darren Strash | 16 February 2015, 08:55:54 UTC | Fix bug that caused slowness in MCS, apply to MISS. | 16 February 2015, 08:55:54 UTC |
| 583c52c | Darren Strash | 13 February 2015, 15:11:18 UTC | Fix coloring strategy to use clique delta | 13 February 2015, 15:11:18 UTC |
| 08ffbdc | Darren Strash | 13 February 2015, 14:52:41 UTC | Correct reColor method to use correct value | 13 February 2015, 14:52:41 UTC |
| 1ac93a5 | Darren Strash | 13 February 2015, 13:41:55 UTC | Improve initial ordering for MCR, MCS | 13 February 2015, 13:41:55 UTC |
| 994bb37 | Darren Strash | 11 February 2015, 12:05:17 UTC | New nested-dissection based ordering strategy. Working connected components algorithm. | 11 February 2015, 12:05:17 UTC |
| 8165a87 | Darren Strash | 10 February 2015, 14:28:04 UTC | Working version with neighbor-reordering. | 10 February 2015, 14:28:04 UTC |
| a007e44 | Darren Strash | 10 February 2015, 12:32:55 UTC | Working connected components algorithm, fixed domination algorithm, start to optimize Isolate removal for sparse graphs. | 10 February 2015, 12:32:55 UTC |
| cc0c619 | Darren Strash | 09 February 2015, 08:37:43 UTC | Slightly better connected components algorithm | 09 February 2015, 08:37:43 UTC |
| c069f50 | Darren Strash | 06 February 2015, 15:36:38 UTC | Very basic connected components algorithm | 06 February 2015, 15:36:38 UTC |
