Additive approximation for edge-deletion problems (Q2389218): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111224696 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0707.0134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separation theorem in property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone Graph Property Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Duality to Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density conditions for triangles in multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a valence problem in extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX-CUT has a randomized approximation scheme in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing versus estimation of graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Checking Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerant property testing and distance approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packing of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem / rank
 
Normal rank

Latest revision as of 18:31, 1 July 2024

scientific article
Language Label Description Also known as
English
Additive approximation for edge-deletion problems
scientific article

    Statements

    Additive approximation for edge-deletion problems (English)
    0 references
    0 references
    0 references
    0 references
    15 July 2009
    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

    Identifiers

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