On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990831313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in finitely defined classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted independent domination problem is NP-complete for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the approximation of a minimum-weight maximal independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum maximal independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the minimum independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar graphs and maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satgraphs and independent domination. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in hereditary classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 03:27, 29 June 2024

scientific article
Language Label Description Also known as
English
On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
scientific article

    Statements

    On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    independent dominating set
    0 references
    \(2P_{3}\)-free graph
    0 references
    perfect graph
    0 references
    approximability
    0 references

    Identifiers

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