The approximation of maximum subgraph problems (Q4630247)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7045101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9526787
0 references
0.94593835
0 references
0.94593835
0 references
0.94518703
0 references
0.9444728
0 references
0.94119024
0 references
0.9411025
0 references
0.9411025
0 references
0.9255097
0 references
