A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062)
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: A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs |
scientific article; zbMATH DE number 7947037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs |
scientific article; zbMATH DE number 7947037 |
Statements
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (English)
0 references
20 November 2024
0 references
greedy algorithm
0 references
polynomial-time approximation scheme
0 references
random graph matching
0 references
0 references
0 references
0 references
0 references
