Augmenting approach for some maximum set problems (Q284765)
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: Augmenting approach for some maximum set problems |
scientific article; zbMATH DE number 6581803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Augmenting approach for some maximum set problems |
scientific article; zbMATH DE number 6581803 |
Statements
Augmenting approach for some maximum set problems (English)
0 references
18 May 2016
0 references
node-deletion problem
0 references
independent set
0 references
dissociative set
0 references
vertex \(k\)-path cover
0 references
feedback vertex cover
0 references
induced matching
0 references
\(k\)-regular induced subgraph
0 references
augmenting graph
0 references
0.9018196
0 references
0.85782033
0 references
0.8465089
0 references
0.84512943
0 references
0.8431543
0 references
0.84235924
0 references
0.8421085
0 references
