On the approximability of the maximum common subgraph problem (Q5096796): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-55210-3_198 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1605991832 / rank | |||
Normal rank | |||
Revision as of 21:43, 19 March 2024
scientific article; zbMATH DE number 7573045
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability of the maximum common subgraph problem |
scientific article; zbMATH DE number 7573045 |
Statements
On the approximability of the maximum common subgraph problem (English)
0 references
18 August 2022
0 references
approximation
0 references
graph problems
0 references
computational complexity
0 references
