-
There are several UI enhancements that would be worth to have in ultra.
For instance, many existing PRs done by @parttimenerd are basic stuffs that we really need to have in Firefox Profiler to mak…
-
### 🚀 The feature, motivation and pitch
I want to do a sort of batched sparse-sparse matrix multiplication, but specifically in the scenario where I have two hybrid sparse coo tensors of the shape (N…
-
This paper proposes a faster algorithm for diameter/radius, and possibly generalizes more broadly to eccentricity-related concepts:
* Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. …
-
(I think this is mostly relevant for undirected graphs.)
_Graph complement_ of an undirected graph (V, E) is (V, K \ E), where K is the clique on all vertices V, e.g. see https://en.wikipedia.org/w…
-
This ticket collects tickets simplifying and improving the graph backends.
It is motivated by the following post:
https://groups.google.com/d/msg/sage-devel/JhirgrbcFMc/CVfHhPCdAgAJ
- #6604: Poli…
-
It would be nice to specialize methods on weighted graphs, with weights representing the capacities. In a lot of situations, people who need flow algorithms work with weighted graphs. It also provide …
-
Follow up from: https://github.com/shenyangHuang/openDG/issues/2
### High-level Idea
- Drop the maps and put all the core data in a large pre-allocated **sparse** tensor.
- A temporal index for …
-
```
We need a new graph type which:
* Can handle arbitrarily huge graphs without performance degradation
* Does not require the whole graph or label collection to be in memory
* Consistent with our…
-
```
We need a new graph type which:
* Can handle arbitrarily huge graphs without performance degradation
* Does not require the whole graph or label collection to be in memory
* Consistent with our…
-
Thank you for your great work on the distance between graphs!
I would like to run your code, but unfortunately, I have been struggling with setting up environments.
I have followed README and instal…