Efficient random graph matching via degree profiles (Q2660385)
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: Efficient random graph matching via degree profiles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient random graph matching via degree profiles |
scientific article |
Statements
Efficient random graph matching via degree profiles (English)
0 references
30 March 2021
0 references
graph matching
0 references
degree profiles
0 references
quadratic assignment problem
0 references
random graph isomorphism
0 references
Erdős-Rényi graph
0 references
0 references
0 references
0 references
