davnils/count-subgraphs davnils/count-subgraphs

  • Stars
    star
    2
  • Language
    C++
  • Created almost 11 years ago
  • Updated almost 11 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
davnils/count-subgraphs
github

davnils

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Implementation of count-thin-subgraphs (Björklund, Kaski, Kowalik; 2013).

More Repositories

1

spoty

Spotify web API in Haskell
Haskell
13
star
2

katt

Unofficial Kattis client (beta)
Haskell
8
star
3

sde-solver

Distributed SDE Solver
Haskell
7
star
4

distr-btc

Distributed market fetching
Haskell
7
star
5

blind-sqli-stats

Applied math + blind sql injections
C++
4
star
6

kool

Distributed Cached C++ Compilation
Haskell
4
star
7

thesis

Master's thesis: Fault detection in photovoltaic systems
Mathematica
4
star
8

spartan-dev-board

FPGA development board with a Xilinx Spartan-3A(N) 50k
3
star
9

while-lang-parser

While language parser
Haskell
3
star
10

regexp-automata

Regexp simulation using finite automata.
Haskell
2
star
11

CV

Curriculum vitae
TeX
2
star
12

minijava-compiler

Compiler for the Minijava language.
Haskell
2
star
13

avr-ethernet

ATmega168 with ENC28J60 ethernet chip
C
2
star
14

tsp-viz

Real time visualization of TSP tours.
Haskell
2
star
15

complexity

Report on parameterized complexity theory and subgraph counting
TeX
1
star
16

avr-asm-dsl

AVR eDSL with verification
Haskell
1
star
17

davnils.github.io

My blog
1
star
18

fenwick-semi

Fenwick trees over semigroups
Haskell
1
star
19

dtd-verifier

DTD verification using NDPDA.
Haskell
1
star
20

kattis-skeleton

Kattis C++ base
C++
1
star
21

kex-sudoku

Bachelor thesis project; solving sudokus.
Objective-C
1
star
22

fpga-cluster-hw

FPGA cluster prototype hardware
1
star
23

formal-fft

Formally verified FFT and DFT implementation
Haskell
1
star
24

static-analysis

Explorations into static analysis on assembly type DSL
Haskell
1
star