Finding maximal common subgraphs via time-space efficient reverse search (Q1790989)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximal common subgraphs via time-space efficient reverse search |
scientific article |
Statements
Finding maximal common subgraphs via time-space efficient reverse search (English)
0 references
4 October 2018
0 references
common subgraphs
0 references
maximum common subgraph problem
0 references
