Additive stabilizers for unstable graphs (Q2419360): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3526040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cooperative Game Theory Foundations of Network Bargaining Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small stabilizers for unstable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing Network Bargaining Games by Blocking Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient stabilization of cooperative matching games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and Fractional Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone Graph Property Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of König subgraph problems and above-guarantee vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network bargaining: using approximate blocking sets to stabilize unstable instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions for the stable roommates problem with payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank

Latest revision as of 13:22, 19 July 2024

scientific article
Language Label Description Also known as
English
Additive stabilizers for unstable graphs
scientific article

    Statements

    Additive stabilizers for unstable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    graph stabilization
    0 references
    Gallai-Edmonds decomposition
    0 references
    matching
    0 references
    vertex cover
    0 references
    approximation algorithm
    0 references
    hardness
    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