|
download
|
|
- Hamiltonian Circuit Experiment Program
:
Ariadne100rev1.3
download : SetupAriadne.exe
for Windows95/98/NT, 153KB
- The Hardest SAT Problem :
hajo1-3.cnf.dimacs
download : hajo1-3.cnf.zip
DIMACS CNF file format, 61KB
- A very hard HCP example for SAT01 :
Hajo graph sample
download : hajo1-3.sat01
SAT01 file format, 225KB
- HCP?SAT01 converter for Baba Labo format :
C++ source file
download : hcp2sat01.cpp
plain text file, 4KB
- Graph Isomorphism Experiment :
Narcissus
download : Narcissus.exe
for Windows 98/XP/2000, 216KB
- Old version for Graph Isomorphism Experiment :
Narkissos
download : SetupNarkissos.exe
for Windows 98/XP/2000, 116KB
-
Provable Polynomial Time Algorithm for Matrix Isomorphism :
ELSIE
download : ELSIE.exe
for Windows 98/XP/2000, 112KB
-
Summary: Matrix & Graph Isomorphism (include Elsie Manual) :
Article
download : MatrixIsomorphism.txt
plain text format, 64KB
-
Full Source Files for ELSIE, ZIP format 44KB :
C++ source files
download : ElsieSource.zip
plain text file, 33KB
-
Strongly Intransitive Graphs and the Perfect Graph Conjecture :
Article
download
: Transitive.pdf
Adobe PDF file, 283KB
-
On the Perfect Graph Conjecture Proof by Jeremy Spinrad : Article
download : skewout.ps
Postscript format file, 324KB
-
16-64 vertices all strongly regular graphs (containing 12 files) :
samples
download : Strongly.zip
zero-one matrix form, 167KB
-
Bug-fix for the dimacs-standard-max-clique-solver dfmax.c :
C source file
download : dfmax.zip
Zip compressed file, 49KB
-
The NP-Completeness of the Hamiltonian Cycle Problem
in Planar Digraphs with Degree Bound Two by Jan Plesnik :
Article
download : Plesnik 8.4.192-196.pdf
Adobe PDF format, 390KB