Packing triangles in low degree graphs and indifference graphs (Q2476287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.07.100 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.07.100 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132434150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the independent set problem for low degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing triangles in bounded degree graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing subgraphs in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K_r\)-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimality and its application on independent sets for \(k\)-claw free graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2007.07.100 / rank
 
Normal rank

Latest revision as of 21:19, 18 December 2024

scientific article
Language Label Description Also known as
English
Packing triangles in low degree graphs and indifference graphs
scientific article

    Statements

    Packing triangles in low degree graphs and indifference graphs (English)
    0 references
    0 references
    0 references
    18 March 2008
    0 references
    packing triangles
    0 references
    approximation algorithm
    0 references
    polynomial algorithm
    0 references
    low degree graph
    0 references
    indifference graph
    0 references

    Identifiers