The approximation of maximum subgraph problems (Q4630247): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-56939-1_60 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1563577400 / rank | |||
Normal rank | |||
Latest revision as of 22:36, 19 March 2024
scientific article; zbMATH DE number 7045101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The approximation of maximum subgraph problems |
scientific article; zbMATH DE number 7045101 |
Statements
The approximation of maximum subgraph problems (English)
0 references
29 March 2019
0 references
planar graph
0 references
graph property
0 references
hereditary property
0 references
acyclic digraph
0 references
subgraph problem
0 references
