-
### The problem
Implement the `IsomorphicHypergraphQ` function, which tests isomorphism between two hypergraphs.
See:
- https://resources.wolframcloud.com/FunctionRepository/resources/Isomorphic…
-
Hi,
Thank you for the great code. I can successfully run the code but it doesn't show any output as like in the paper. Therefore I want to know how can I reproduce the results and visualizations as s…
ans92 updated
3 years ago
-
The following matrix causes a segmentation fault when trying to partition
CSV file with matrix elements `problem_matrix.csv`:
```
cols,rows,values
2,5,1
3,9,1
4,13,1
6,6,1
7,10,1
8,14,1
9…
-
### The problem
Implement the `RandomHypergraph` function.
### Possible solution
A possible implementation and API is found in the [WFR](https://resources.wolframcloud.com/FunctionRepository/reso…
-
I'm interested in the parallel scan algorithm for the linear-chain CRF.
I read the related paper in the tutorial and found that there are two steps:
up sweep and down sweep in order to obtain all-…
-
## Common Classes
```chpl
class Vertex {
var edge : Set(Edge);
// Base Class Methods
}
class Edge {
// Base Class Methods
}
```
## Directed and Undirected Hypergraphs
Docum…
-
Hello.
I'd like to learn is it possible to classify graphs with edges connecting more than two nodes?
For example, if we have a classical graph, we use an adjacency matrix like (N, N) and edge featu…
-
This issue indicates CHGL supports finding connected components: #11 but the [documentation](https://pnnl.github.io/chgl/search.html?q=component&check_keywords=yes&area=default) does not seem to show…
-
Negative formulations of some axioms place cognitive burden on the reader, plus make implicit assumptions on the "universal set" implied. I guess, the intention is to safeguard the machinery by making…
-
This library seems very exciting, but you are using a lot of hypergraph language that leaves me a bit uncertain. Perhaps some intro text in the docs to define "blacklisted", "toplexes", etc. Also, p…