-
For streaming partitioning experiments, we need two baseline methods. First one is the de-facto hash partitioning, which is expected to perform worse. The other one is the golden standard partitioning…
-
The Boyer-Myrvold planarity test for [prism graphs](https://en.wikipedia.org/wiki/Prism_graph) appears to run in quadratic time complexity:
``` c++
#include
#include
#include
#include
us…
-
### Rivers, Sections, and Rapids as Data Structures
`Rivers` can be imagined as an arrays of `sections`. They are an ordered sequence of `rapid` properties where the order is relevant. The `rapids` w…
-
- [ ] lcc: reduce to the largest connected component or union thereof
- [x] bisect: split the graph by left left, left right, etc.
- [ ] sort meta/adj by class, hemisphere, etc
- [ ] preprocessing…
-
I am trying to implement a neural network model to predict the number of nodes in a graph that satisfy some specific property indicated by the node features and features of the node neighbours. The ne…
-
We don't have a completely satisfactory implementation of data and functions to represent the DAG.
### Finding a library
* I can't find a suitable multigraph implementation in Julia. `Graphs.jl`…
-
A few things
(6 marks) For these six sub-questions, you are not allowed to use any additional data structure.
What is the tightest time complexity of DFS if it is run from a source vertex v of a gra…
-
Hi,
I am going through the literature of the paper and one thing which I find missing is information about inductiveness of the proposed algorithm.
So my question is, Is the proposed architectu…
-
### Is this a new feature, an improvement, or a change to existing functionality?
New Feature
### How would you describe the priority of this feature request
Critical (currently preventing us…
-
In 22.02, this began as a list of documentation/example/testing-related issues, and in 22.06, was updated to include issues found in releases 22.02 and 22.04.
It's now an epic, and previous issues …