Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071170329 / rank | |||
Normal rank | |||
Revision as of 22:47, 19 March 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
