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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.01.019 / 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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.01.019 / rank
 
Normal rank

Latest revision as of 15:17, 18 December 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