Augmenting approach for some maximum set problems (Q284765): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6581803 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
node-deletion problem | |||
| Property / zbMATH Keywords: node-deletion problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
independent set | |||
| Property / zbMATH Keywords: independent set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dissociative set | |||
| Property / zbMATH Keywords: dissociative set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex \(k\)-path cover | |||
| Property / zbMATH Keywords: vertex \(k\)-path cover / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
feedback vertex cover | |||
| Property / zbMATH Keywords: feedback vertex cover / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
induced matching | |||
| Property / zbMATH Keywords: induced matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(k\)-regular induced subgraph | |||
| Property / zbMATH Keywords: \(k\)-regular induced subgraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
augmenting graph | |||
| Property / zbMATH Keywords: augmenting graph / rank | |||
Normal rank | |||
Revision as of 18:23, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Augmenting approach for some maximum set problems |
scientific article |
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
