ahgamut/cliquematch: cliquematch
release_p4ivjl2x3va2jfrh7ztckytt5q
by
Gautham
2020
Abstract
<code>cliquematch</code> Finding correspondence via maximum cliques in large graphs The <code>cliquematch</code> package aims to do two specific things: Find maximum cliques in large sparse undirected graphs, as quickly and efficiently as possible. <code>cliquematch</code> provides fast C++ implementations solving the maximum clique and clique enumeration problem. Many applications of the clique problem, such as fingerprint matching, image registration, or molecule alignment involve construction of a graph from two given datasets. <code>cliquematch</code> provides flexible methods to construct large sparse undirected graphs in-memory for such applications. Source code at https://github.com/ahgamut/cliquematch View the documentation at https://cliquematch.readthedocs.io/
In text/plain
format
Archived Content
There are no accessible files associated with this release. You could check other releases for this work for an accessible version.
Know of a fulltext copy of on the public web? Submit a URL and we will archive it
article
Stage
published
Date 2020-11-17
Version
v2.2.0
access all versions, variants, and formats of this works (eg, pre-prints)
Datacite Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar