Licheng Zhang's repositories

qud

Quadrangulation with the longest induced cycle of length 6

Language:C++License:MITStargazers:1Issues:0Issues:0

awesome-ebooks

收录开源的经典技术书籍 PDF 文件及相关网站,持续更新中...

Stargazers:0Issues:0Issues:0

beoi-training

Public training materials for Belgian Oympiad in Informatics

Language:TeXStargazers:0Issues:0Issues:0
Language:TeXStargazers:0Issues:1Issues:0

cds-code

An implementation of connected dominating sets in triangulations

Language:PythonStargazers:0Issues:0Issues:0

CographGeneration

Cograph Generation (linear delay) - format g6

Language:C#Stargazers:0Issues:0Issues:0
Language:JavaLicense:MITStargazers:0Issues:0Issues:0

doc

Documentation

Language:HTMLLicense:MITStargazers:0Issues:0Issues:0
Stargazers:0Issues:1Issues:0

quadrangulations

all quadrangulations on 14 vertices.

Stargazers:0Issues:1Issues:0

Spectra-of-graphs

One Mathematica program computes the spectrum of a graph with a Laplacian on the edges (a quantum graph). The other programs find sets of isospectral quantum graphs.

Language:MathematicaLicense:MITStargazers:0Issues:0Issues:0

competitive-programming

Solutions to some of good questions asked in coding rounds for internship/placements in big companies.

Language:C++Stargazers:0Issues:0Issues:0

FastPartitioner

A fast hypergraph partitioner that runs on the GPU

Language:C++License:MITStargazers:0Issues:0Issues:0

hamiltonian_cycles

Code and data related to the paper "Few hamiltonian cycles in graphs with one or two vertex degrees"

Language:CLicense:MITStargazers:0Issues:0Issues:0

IGraphM

IGraph/M is the igraph interface for Mathematica

Language:MathematicaLicense:NOASSERTIONStargazers:0Issues:0Issues:0
Language:SageStargazers:0Issues:0Issues:0

joeis

Java implementations of sequences in the OEIS

Stargazers:0Issues:0Issues:0

K2-Hamiltonian-Graphs

This repository contains four programs which were created for the article "J. Goedgebeur, J. Renders, G. Wiener and C.T. Zamfirescu, K2-Hamiltonian Graphs: II, manuscript", as well as some certificates that can be used to verify some of the computer-aided proofs in this article.

Language:CLicense:NOASSERTIONStargazers:0Issues:0Issues:0

longestCycles

Code related to counting the number of pairwise distinct longest cycles of a graph

Language:C++Stargazers:0Issues:0Issues:0

m3c

Python scripts for generating minimally 3-connected graphs

Language:CythonLicense:Apache-2.0Stargazers:0Issues:0Issues:0

Minimum-Cost-Perfect-Matching

C++ implementation of algorithms for finding perfect matchings in general graphs

Language:C++License:MITStargazers:0Issues:0Issues:0

NSFC-application-template-latex

国家自然科学基金申请书正文(面上项目)LaTeX 模板(非官方)

Language:TeXLicense:MITStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0

ptmst

Probability Theory and Mathematical Statistics Tutorial

Stargazers:0Issues:0Issues:0

Sparse-maximal-2-planar-graphs

Code repository for the paper titled "The number of edges in maximal 2-planar graphs" by Michael Hoffmann and Meghana M Reddy

Language:C++Stargazers:0Issues:0Issues:0

tikzit

pgf/TikZ diagram editor

Language:C++License:GPL-3.0Stargazers:0Issues:0Issues:0

tinygraph

exploring graph conjectures on small graphs

Language:C++License:Apache-2.0Stargazers:0Issues:0Issues:0