Graph stabilization: a survey

DOI10.1007/978-981-10-6147-9_2MaRDI QIDQ4689625zbMATH OpenOpenAlexFDO

Authors 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) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10)

Recommendations

• Finding small stabilizers for unstable graphs
• Stabilizing weighted graphs
• Finding small stabilizers for unstable graphs
• Stabilizing network bargaining games by blocking players
• Efficient stabilization of cooperative matching games

Cites work

• A characterization of the graphs in which the transversal number equals the matching number
• A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
• Additive approximation for edge-deletion problems
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Algorithmic Game Theory
• College Admissions and the Stability of Marriage
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Computational Aspects of Cooperative Game Theory
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
• Efficient stabilization of cooperative matching games
• Finding small stabilizers for unstable graphs
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 5485541 (Why is no real title available?)
• scientific article; zbMATH DE number 3557552 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• scientific article; zbMATH DE number 3361920 (Why is no real title available?)
• Integer and Fractional Matchings
• Matching theory
• Maximum matching and a polyhedron with 0,1-vertices
• Multiagent Systems
• Network bargaining with general capacities
• Networks, crowds and markets. Reasoning about a highly connected world.
• On solution concepts for matching games
• Paths, Trees, and Flowers
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
• Social and economic networks.
• Solutions for the stable roommates problem with payments
• Stabilizing network bargaining games by blocking players
• Stable outcomes of the roommate game with transferable utility
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• The assignment game. I: The core
• The bargaining problem
• The complexity of König subgraph problems and above-guarantee vertex cover
• The cooperative game theory foundations of network bargaining games
• The design of approximation algorithms
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

Cited in

(6)

• scientific article; zbMATH DE number 5942896 (Why is no real title available?)
• Stabilizing weighted graphs
• Stabilizing weighted graphs
• Self-stabilizing metric graphs
• Stabilization of capacitated matching games
• Stabilization of capacitated matching games

This page was built for publication: Graph stabilization: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689625)