A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773)
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 simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications |
scientific article; zbMATH DE number 7286736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications |
scientific article; zbMATH DE number 7286736 |
Statements
16 December 2020
0 references
plane graph
0 references
graph isomorphism
0 references
maximum common subgraph
0 references
0 references
0.7486015558242798
0 references
0.7472601532936096
0 references
0.7462255358695984
0 references
0.7445599436759949
0 references
0.7422199249267578
0 references
