Graph stabilization: A survey

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Graph stabilization has raised a family of network design problems that has received considerable attention recently. Stable graphs are those graphs forwhich the matching game has non-empty core. In the optimization terminology, they are graphs for which the fractional matching linear program has an integral optimum solution. Graph stabilization involves minimally modifying a given graph to make it stable. In this survey, we outline recent developments in graph stabilization and highlight some open problems.

Original languageEnglish (US)
Title of host publicationCombinatorial Optimization and Graph Algorithms
Subtitle of host publicationCommunications of NII Shonan Meetings
PublisherSpringer Singapore
Pages21-41
Number of pages21
ISBN (Electronic)9789811061479
ISBN (Print)9789811061462
DOIs
StatePublished - Oct 2 2017

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)
  • Economics, Econometrics and Finance(all)
  • Business, Management and Accounting(all)

Fingerprint Dive into the research topics of 'Graph stabilization: A survey'. Together they form a unique fingerprint.

  • Cite this

    Chandrasekaran, K. (2017). Graph stabilization: A survey. In Combinatorial Optimization and Graph Algorithms: Communications of NII Shonan Meetings (pp. 21-41). Springer Singapore. https://doi.org/10.1007/978-981-10-6147-9_2