Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approximation algorithm for node-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Minimum Chain Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:49, 7 July 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

    Identifiers