On the complexity of the independent set problem in triangle graphs (Q2275391): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jacek Błażewicz / rank
 
Normal rank
Property / author
 
Property / author: Alexandre Dolgui / rank
 
Normal rank
Property / author
 
Property / author: Valery S. Gordon / rank
 
Normal rank
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.disc.2011.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091196599 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57387734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose maximal cliques and stable sets intersect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / 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 maximum independent set problem for cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Parameters on Neighborhood Number of A Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs within time windows on identical parallel machines: New model and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good: Approximating independent sets in sparse and bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in CAN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weighted independent sets on transitive graphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independent neighbourhood number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / 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: Maximum independent sets in subclasses of \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization and hereditary properties for partition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing independent sets in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of an interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite bihypergraphs: a survey and new results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462151 / rank
 
Normal rank

Latest revision as of 09:41, 4 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the independent set problem in triangle graphs
scientific article

    Statements

    On the complexity of the independent set problem in triangle graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 August 2011
    0 references
    0 references
    independent set
    0 references
    neighborhood set
    0 references
    triangle condition
    0 references
    triangle graph
    0 references
    \(NP\)-completeness
    0 references
    approximability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references