-
Hey,
thought that I would open a new issue here to discuss what we should analyze. These are some of the things that I found. I'll look for more stuff, but this could serve as a beginning point for…
-
**What is the feature or improvement you would like to see?**
A biclique is an equivalent of cliques in a bipartite graphs. It is a vertex subset in which all "top" vertices connect to all "bottom"…
-
Networkx has the Laplacian matrix supported, moreover, I would like to see the `signless` Laplacian.
According to [__Spectra of Graphs__](https://www.win.tue.nl/~aeb/2WF02/spectra.pdf) by Brouwer a…
-
On Julia 1.9.2 with GraphsMatching 0.2.0, the code from the introductory example does not run:
```
julia> using Graphs, GraphsMatching
julia> g = complete_graph(3)
julia> w = zeros(3,3)
julia> w[…
-
[This paper](http://www.machinelearning.org/archive/icml2009/papers/281.pdf) makes it easier to train previous algorithms. The paper doesn't discuss directed graphs explicitly but says it can be mappe…
-
The `nodes` argument to `from_networkx` shadows the `nodes` argument to `bipartite_layout`, so the keyword argument is not forwarded to the layout function.
http://holoviews.org/Reference_Manual/ho…
-
Add support for graphs.
A graph G can be represented with an adjacency matrix of G. If the matrix is symmetrical the graph is undirected. If the coefficients of the matrix are only 0 or 1, then G i…
-
I noticed that most 2-mode "Norwegian Board of Directors", which are supposed to be bipartite, actually contains odd-length cycles. For example, in data
```
Norwegian_Board_of_Directors_net2mode_20…
-
It would be super-duper handy to be able to automatically generate input graphs and node selection lists (i.e., masks) to run with both NetworkX and `graphblas-algorithms` and compare results.
For …
-
Added `matching_generating_poly`, modified `matching_polynomial`, added an option
to `permanental_minor_polynomial`, which for some graphs is faster than the previous
algorithm.
`matching_generatin…