Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s40305-020-00335-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119171189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Tuza about packing and covering of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Subgraphs without Short Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the small cycle transversal of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization for cycle transversal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on triangles of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Dual Integrality of Triangle Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering triangles in edge-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996998 / rank
 
Normal rank

Latest revision as of 12:48, 27 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
scientific article

    Statements

    Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (English)
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    \(k\)-cycle transversal
    0 references
    \(k\)-clique transversal
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references