-
### Problem Description
Currently, there are no existing implementation of the generators for the following graphs/ digraphs:
- Bicorn graph
- Tricorn graph
- Murty graph
- KohTindell digraph
…
-
### Is your feature request related to a problem? Please describe
Currently [vmui for VictoriaLogs](https://docs.victoriametrics.com/victorialogs/querying/#web-ui) shows a bar chart with the number o…
-
I've started working on a [notebook](https://github.com/padath314/NetworkX-contribution/blob/main/GraphMatching.ipynb) about the Graph Matching algorithm and have been using the following Wikipedia pa…
-
Since the default configuration of node_hidden_sizes is a vector of length 1, will the layers in the _for_ loop on lines 38:40 ever get created?
https://github.com/Lin-Yijie/Graph-Matching-Networks…
-
This is disconcerting because the counts for these events are what drive the deployment monitoring, specifically the alarm configurations. The following screenshot illustrates these discrepancies for …
-
So what exactly is graph matching useful for in the real world?
-
Would you please upload the presentation from today? I would like to look back over the theorems and algorithms that were mentioned (I didn't get to write them all down).
Nice presentation and thanks…
-
To whom it may concern,
Thank you for making VG available and keeping it up to date.
Personally, I use the gaf alignment format extensively, and I am hoping the gaf file can embed the query seque…
-
An important aspect of the search on the current website is that identifiers like Derge number (ex: `D242`) and ISBNS (ex: `9789380359700`) can be found (if you select "search as identifier"), and dat…
-
## 🚀 Feature
[Graph Matching Networks for Learning the Similarity of Graph Structured Objects](https://proceedings.mlr.press/v97/li19d/li19d.pdf)
There is model available in DGL that can do simila…