GitHub - kazimierz-256/Maximum-common-unlabelled-subgraph-algorithm: An exact algorithm for finding the maximum common induced subgraph of two unlabelled graphs. Two derivative approximating algorithms are also implemented. All rights reserved.

kazimierz-256 / Maximum-common-unlabelled-subgraph-algorithm Public

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 283 Commits
Application itself		Application itself
Graph		Graph
GraphExtensionAlgorithms		GraphExtensionAlgorithms
GraphManualExporter		GraphManualExporter
MathParser		MathParser
SubgraphIsomorphismBenchmark		SubgraphIsomorphismBenchmark
SubgraphIsomorphismExactAlgorithm		SubgraphIsomorphismExactAlgorithm
SubgraphIsomorphismTests		SubgraphIsomorphismTests
.gitattributes		.gitattributes
.gitignore		.gitignore
LICENSE		LICENSE
SubgraphIsomorphism.sln		SubgraphIsomorphism.sln
TAiO_wojciechowskik_dokumentacja_raport.pdf		TAiO_wojciechowskik_dokumentacja_raport.pdf

Repository files navigation

All rights reserved. I encourage you to contact the authors for permission.

No releases published

No packages published