A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037)
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: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound |
scientific article; zbMATH DE number 3937217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound |
scientific article; zbMATH DE number 3937217 |
Statements
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (English)
0 references
1986
0 references
lambda-extendible graph property
0 references
construction
0 references
large bipartite
0 references
graphs
0 references
large balanced graphs
0 references
large acyclic graphs
0 references
spanning subgraph
0 references
0 references
