-
Currently KOMB relies on [igraph](https://igraph.org/c/) for k-core decomposition. Hence, although all the adjacency information for the graph construction is done in the functions `Kgraph::readSAM`, …
-
### What happened?
Hi,
Then i try to use your tool on my large project with SPM, i receive this error output:
> *** Terminating app due to uncaught exception 'NSInvalidArgumentException', reaso…
-
### What is your question?
Hi,
I use the Leiden clustering a lot. Louvain as well, sometimes. I am experiencing big differences in the results when I use 23.02 and newer versions. My dataset has 80…
-
Let us say we use P-384 for an ECDSA ecdsa-rdfc-2019. The specification clearly says that SHA-384 must be used to hash the transformed document in the (1) and (2) bullet points of [§ 3.2.4 Hashing](ht…
-
**Describe the bug**
Uptime CI Takes enormously long to run and fails sometimes
**To Reproduce**
I have my own corn, which trigger workflow run every 5 minutes (because GitHub is not too …
-
> the quadratic complexity of the self-attention module restricts Graphormer’s application on large graphs.
The paper describes graphormer as not applicable to large graphs. What is the maximum num…
-
Hey,I find it will be veryyyyyyyyyyyy cost time if i set a slightly larger batch_num for this model in graphormer calculation phase for a total batch graph . One simple method to solve, i do , its use…
-
I'd like to use custom graphs with Search-by-Distance custom tags. To use genres from online music databases. For example a Discogs graph with Discogs tags.
I've made [graphs here](https://github.c…
-
We need a "large rr_graph" test for [vprgen](https://github.com/leon575777642/vprgen).
I would suggest the test does;
* Generate the large rr_graph
* Write the rr_graph to XML
* Read the rr_g…
-