-
**Description of bug**
May be more of a limitation than a bug, especially given the experimental status of this piece of code.
I am running into `StackOverflowError`s when comparing graphs using `…
-
-
While there currently is an iterator (issue #10717), I would like to be able to invoke `RandomStream` from multiple locales in a way that is scalable to call from multiple tasks and locales. I would l…
-
1. By using the GPU, we are able to reduce the complexity of linear-chain CRF from O(NT^2) to O(log N). where N is the sentence length and T is the number of labels.
So, if I view the linear-chain …
-
```
The current functions generate and generate_hypergraph assume that the user
wants a graph to be created and then have random nodes & edges attached,
however the functions make no provision for add…
-
Similar to #266, the `__getitem__` method is not implemented consistently across different complex types:
- For simplicial complexes, `SC[simplex]` returns the user-defined attributes associated wi…
-
# The problem:
``` r
library(ergm)
data(florentine)
## Business as dyad covariate for marriage
flomarriage %n% "business" edgecov.business
#> 8
```
``` r
## Consider a subg…
-
This feature is deferred to the next backend push, as it complicates the data model, and to an extent also the display, relative to its current simplicity.
Currently, types are extracted in/for rela…
-
Dear authors,
Our lab has been working on partitioning a C++ FPGA design for parallel placement and routing. We are very interested to try KaHyPar to replace our current ILP solution.
However, i…
-
Node reductions are great!
# What
This is an important case of graph reductions. There are requests in both the UI and APIs to do reductions at the level of node, multiedge, and multiple nodes / …