-
Maybe we can implement the functionality we use, or just use functions from igraph
ghost updated
4 years ago
-
-
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…
-
Since RDF natively supports only binary relations, relations between
more than two entities must be encoded using groups of triples.
A W3C Working Group Note[9] describes some common patterns,
but …
-
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…
-
The current implementation reads position data from a file and positions the vertices accordingly. By default these would directly correspond to spatial positions in the recording or the simulation. I…
-
It would be nice to have a more comprehensive dictionary of e-graph rules for FinOrd and combinatorial species.
My shelved PR for egg that needs dusted off and finished. I implemented most of the c…
-
```
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…
-
```
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…
-
### The problem
We need to understand how to use machine learning to classify, find anomalies, etc. for Wolfram model rules and evolutions. Ultimately, we want to be able to feed Wolfram model states…