Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning |
scientific article; zbMATH DE number 7639804
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning |
scientific article; zbMATH DE number 7639804 |
Statements
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (English)
0 references
9 January 2023
0 references
clique
0 references
planted clique
0 references
machine learning
0 references
graph convolutional network
0 references
0 references
