-
topological_sort_recursive does not seem to be in the code I am using. I have download the latest version from githib and installed it but it gives this error:
```
Traceback (most recent call las…
ghost updated
6 years ago
-
```python
def bn(g):
"""
Defined as the largest number of vertices that induces a bipartite subgraph
sage: bn(graphs.PetersenGraph())
7
sage: bn(c4)
4
sage: b…
-
The MLG-MCG graph is also known as a bipartite network. This is a special kind of network where there are two kinds of nodes and connections may only be between nodes of different types.
A simple …
-
The edge_bipartite_number of a graph G is the largest number of edges in an induced bipartite subgraph of G.
A naive algorithm is to consider every subset of vertices, check if it induces a biparti…
-
I was sifting through the networkx docs and didn't find functionality for [minimum edge cover](https://en.wikipedia.org/wiki/Edge_cover).
Is this functionality available? If not, would there be any …
-
### System information
- **Have I written custom code (as opposed to using a stock example script provided in TensorFlow)**: No
- **OS Platform and Distribution (e.g., Linux Ubuntu 16.04)**: Windows…
-
The star graph s3 could either be a graph with 3 vertices or 3 edges (4 vertices).
a better (less confusable) name for the star graphs would be k_1_n where n is the number of rays. so Sage's s3 wo…
-
- edge hiding based on multiplicity/bsize (works ok in a non-collapsing model, but once you start collapsing clusters things start to go bad) -- it'd be possible to integrate this with the full graph …
-
Hello,
It seems that the lp formulation for `maximum_weight_maximal_matching` enforces that all the nodes in v1 (i.e. the smaller partition of the vertices) have to be matched (l 65 of lp.jl)
This …
mburq updated
7 years ago
-
Hi, I implemented ~80 rules using `ManyToOneReplacer` for Rubi integration and MatchPy was able to match the subjects very quickly. However, when I added ~550 rules, there was significant decrease in …