-
> Moving far beyond the simplistic string matching which NNexus does in the direction of HDM, we talked about far more sophisticated types of autolinking (which should have information stored in [Arxa…
-
```
There has been some interest in a multigraph implementation. Both digraph
and graph classes should have their respective multigraph implementation.
Hypergraphs already support it out of the box.
…
-
Hello authors of ViHGNN,
When I tried to run the fuzzy c-means to form hypergraphs, I found the hyperedge matrix is suspiciously dense, so I went back to check the actual implementation and found t…
-
```
Hello!
Thanks, firstly for your work on python-graph. We're using hypergraphs to help
study discourse structure.
I was wondering if you would feel ready to upload your python-graph and
pytho…
-
I'm wondering if you would consider accepting an addition to add a `HyperEdge` trait,
which would allow the library to encode Hypergraphs.
Presumably it could be an edge with a `I: Iterator` in pl…
-
Hi there,
I was reading your blog post which mention the possibility of a decomposition for k-edges which could be applied to (IIUC) hypergraphs of with hyperedges of a fixed order k.
Have you con…
-
We should have `Hypergraph` inherit from `DiHypergraph` or vice-versa as well as `IDView`/`DiIDView` to avoid overly duplicated code.
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
The documentation of the results in /graphdata is pretty short.
It seems `.nodes.csv` contains only the nodes with the node ID being the first CSV column.
Also `.edges.csv` are the edges. However, …
-
There is one paper that claimed to use your dataset (MicroVideo) *He, Li, et al. "Click-Through Rate Prediction with Multi-Modal Hypergraphs." Proceedings of the 30th ACM International Conference on I…