Graph Stabilization: A Survey

DOI10.1007/978-981-10-6147-9_2zbMath1397.05185OpenAlexW2758629962MaRDI QIDQ4689625

Karthekeyan Chandrasekaran

Publication date: 16 October 2018

Published in: Combinatorial Optimization and Graph Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-6147-9_2

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Stabilization of capacitated matching games ⋮ Stabilizing Weighted Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient stabilization of cooperative matching games
• A characterization of the graphs in which the transversal number equals the matching number
• The complexity of König subgraph problems and above-guarantee vertex cover
• Finding small stabilizers for unstable graphs
• Matching theory
• Geometric algorithms and combinatorial optimization.
• Stable outcomes of the roommate game with transferable utility
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Additive approximation for edge-deletion problems
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• The assignment game. I: The core
• Network Bargaining with General Capacities
• Detecting high log-densities
• Computational Aspects of Cooperative Game Theory
• The Design of Approximation Algorithms
• The Bargaining Problem
• Stabilizing Network Bargaining Games by Blocking Players
• A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
• On Solution Concepts for Matching Games
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• The Cooperative Game Theory Foundations of Network Bargaining Games
• Multiagent Systems
• Integer and Fractional Matchings
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Solutions for the Stable Roommates Problem with Payments
• Paths, Trees, and Flowers
• Algorithmic Game Theory
• Maximum matching and a polyhedron with 0,1-vertices
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
• College Admissions and the Stability of Marriage