Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214): 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.ipl.2011.09.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003253430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-transversals and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the cliques of a graph with vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs are clique-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Transversal Sets in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the clique-transversal number of regular graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
scientific article

    Statements

    Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (English)
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    clique-transversal set
    0 references
    clique-independent set
    0 references
    approximation algorithm
    0 references
    NP-complete
    0 references
    cubic graph
    0 references

    Identifiers

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