Skip to content
Snippets Groups Projects
Select Git revision
  • master default protected
1 result
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.021Feb31Oct26Sep26Jul24Jun1817131175130May2124Apr18221Mar20628Feb25Jan241610completed thesismastermasterworking base versioncorrect versionWorking on gpu DSAdd destructorsDominating set working for CPUdominating set out of order introduce fixedCPU and GPU MIS workingIndependent set working correctlyCreated test data and made slight changes to programThree decomposition computing finishedjoin bag, forget bag alorithm implementedTreedecomposition precomputing doneWorking parsing of graph and treeTimekeeping and memory usageOut of order introduce dominating setpartially implemented CPU dominating setgpu implementation of independent set which works when vertices are added out of orderWorking GPU implementation for independent setnecessary commit for rollbacknot working version of a tree decomposition implementationPath decomposition working on GPUadded the ternaryOperators for the CPU implementation of dominating setadded a way to time and log a runNodes in bags are saved in increasing orderImplemented MIS sequentially and parallel for path decompositionImplemented MIS for nice graph decompositionAdded a simple graph to the program