patmorin Goto Github PK

3-track

Track number 3 implies layered pathwidth 8

af2t

Anagram-free edge-colouring of 2-trees

alantree

Alan Frieze's model for growing a random spanning tree in a graph

alphapop

Kid's game to help with character recognition

anagram-free

Anagram-free colourings

anagram-free2

Anagram-free list colouring

antcrunch

antmunch

A simple pygame game

arraylayout

Experiments with array layouts for comparison-based searching

avgtheta

The average degree of theta graphs

avgtheta-code

Mathematica Notebooks for Calculation of Average Degree in Theta Graphs

bin

cds-code

An implementation of connected dominating sets in triangulations

cds2

Connected dominating sets in triangulations

central2csv

Convert Carleton Central's class lists into csv files

cglab

cglab.ca website stuff

collsets

Dual circumference and collinear sets

comp4804

Materials for COMP4804

deathprob

Calculate your life expectancy and probability of dying in the next year

deathprob2

Compute your probability of dying within the next year

distance-labelling

encoding

A survey about encoding arguments

extremal-1-planar

The maximum number of edges in 1-planar graphs avoiding certain subgraphs

facial

Facial non-repetitive colouring of planar graphs

fan-partition

Fan-Partitions of Planar Graphs (and Beyond) by Local Sparsification and Volume-Preserving Emeddings

fasttri

Fast Tripod Decomposition of Planar Graphs

fastws

A paper about reducing the constants in working-set structures

fetchmoss

Fetch reports from MOSS (https://theory.stanford.edu/~aiken/moss/)

foxtrot

The foxtrot algorithm for finding light paths in a hypercube

franklin

Probabilistic analysis of Franklin's algorithm for leader election on the ring