The parameterized complexity of geometric graph isomorphism (Q309786)
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: The parameterized complexity of geometric graph isomorphism |
scientific article; zbMATH DE number 6624618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity of geometric graph isomorphism |
scientific article; zbMATH DE number 6624618 |
Statements
The parameterized complexity of geometric graph isomorphism (English)
0 references
7 September 2016
0 references
point set congruence
0 references
graph isomorphism
0 references
lattices
0 references
0 references
0.9905101656913756
0 references
0.8747705817222595
0 references
0.8069307804107666
0 references
0.8025954365730286
0 references
