Search results

Feature wise subgraph matching benchmarks

Status: Open.

#27 In jdmoorman/uclasm;

· okpatil4u opened on Apr 8, 2021

Speed up alldiff counting

Status: Open.

#20 In jdmoorman/uclasm;

· jdmoorman opened on May 12, 2020

Speed up the edgewise cost stuff

Status: Open.

#19 In jdmoorman/uclasm;

· jdmoorman opened on May 12, 2020

Edge costs

Status: Open.

#18 In jdmoorman/uclasm;

· jdmoorman opened on May 12, 2020

Bring back the contents of the <code>counting</code> directory on <code>develop</code>

Status: Open.

#16 In jdmoorman/uclasm;

· jdmoorman opened on Apr 24, 2020

Rewrite <code>count_alldiff</code>

Status: Open.

#15 In jdmoorman/uclasm;

· jdmoorman opened on Apr 24, 2020

Add <code>matching</code> to <code>MatchingProblem</code>

Status: Open.

#14 In jdmoorman/uclasm;

· jdmoorman opened on Apr 24, 2020

Write a function for getting a Graph from a networkx object.

Status: Open.

#13 In jdmoorman/uclasm;

· jdmoorman opened on Apr 23, 2020

Remove lsap.py once clapsolver is up and running.

Status: Open.

#12 In jdmoorman/uclasm;

· jdmoorman opened on Apr 23, 2020

Change repository name to subgraph-matching or similar.

Status: Open.

#11 In jdmoorman/uclasm;

· jdmoorman opened on Apr 23, 2020