Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:17, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization |
scientific article |
Statements
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (English)
0 references
13 March 2014
0 references
graph deletion problems
0 references
approximation algorithms
0 references
primal-dual
0 references
