An algorithm for maximum common subgraph of planar triangulation graphs (Q4922160)
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: An algorithm for maximum common subgraph of planar triangulation graphs |
scientific article; zbMATH DE number 6167780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for maximum common subgraph of planar triangulation graphs |
scientific article; zbMATH DE number 6167780 |
Statements
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs (English)
0 references
28 May 2013
0 references
planar triangulation graphs
0 references
Delauney triangulation
0 references
maximum common subgraph
0 references
0.8345655798912048
0 references
0.8291791677474976
0 references
0.8152002692222595
0 references
0.810234010219574
0 references
