-
The source code uses sfdp library for graph coarsening, but the paper is about the graph coarsening methods proposed by yourself. Is there any corresponding implementation?
-
## Keyword: sgd
### A Convergence Theory for Federated Average: Beyond Smoothness
- **Authors:** Authors: Xiaoxiao Li, Zhao Song, Runzhou Tao, Guangyi Zhang
- **Subjects:** Machine Learning (cs.LG);…
-
Version 0.5.0.
This very artificial and unrealistic (!!) test TriG file has a 2-element list in graph :G and there is a triple in :G1 that references one of the list cell bnodes.
```
# Lists across …
-
Google Research blog post:
https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/
The actual paper:
https://epubs.siam.org/doi/10.1137/1.9781611977912.111
This wou…
-
I miss a good set of modules for implement traditional data structures. It's true that collectionjs it's ok, but in special I miss trees and more complex structures.
https://en.wikipedia.org/wiki/Lis…
-
Hi,
Is there a roadmap for monocular SLAM (with a normal camera, not Kinect) ?
Or is it relatively easy to use ScaViSLAM for a monocular SLAM scenario, with minimal code changes?
If so, what parts …
-
```
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…
-
```
(Pdb) G.add_nodes_from([1, 2, 3])
(Pdb) G.add_edges_from([(1,2), (1,3)])
(Pdb) G
(Pdb) nx.complete_to_chordal_graph(G)
(, {1: 0, 2: 0, 3: 0})
```
Shouldn't a PEO here be 2, 1, 3?
-
Hello!
I recently needed to decide whether some large graphs contain the Petersen graph P. As it turned out the task was time consuming since almost none of the graphs contained P.
My original gra…
-
Related to #116.
It would be helpful if the neighbor iteration order was reversed, to match the insertion order. I'm assuming the way it works now is a result of simplicity/optimization, and not th…