Graph stabilization: A survey

Karthekeyan Chandrasekaran

doi:10.1007/978-981-10-6147-9_2

Graph stabilization: A survey

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English (US)
Title of host publication	Combinatorial Optimization and Graph Algorithms
Subtitle of host publication	Communications of NII Shonan Meetings
Publisher	Springer
Pages	21-41
Number of pages	21
ISBN (Electronic)	9789811061479
ISBN (Print)	9789811061462
DOIs	https://doi.org/10.1007/978-981-10-6147-9_2
State	Published - Oct 2 2017

ASJC Scopus subject areas

General Computer Science
General Economics, Econometrics and Finance
General Business, Management and Accounting
General Mathematics

Online availability

10.1007/978-981-10-6147-9_2

Library availability

Discover UIUC Full Text

Cite this

@inbook{914cfcf766d34eeb9fd998c8610c074c,

title = "Graph stabilization: A survey",

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.",

author = "Karthekeyan Chandrasekaran",

year = "2017",

month = oct,

day = "2",

doi = "10.1007/978-981-10-6147-9_2",

language = "English (US)",

isbn = "9789811061462",

pages = "21--41",

booktitle = "Combinatorial Optimization and Graph Algorithms",

publisher = "Springer",

address = "Germany",

}

TY - CHAP

T1 - Graph stabilization

T2 - A survey

AU - Chandrasekaran, Karthekeyan

PY - 2017/10/2

Y1 - 2017/10/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85042628274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042628274&partnerID=8YFLogxK

U2 - 10.1007/978-981-10-6147-9_2

DO - 10.1007/978-981-10-6147-9_2

M3 - Chapter

AN - SCOPUS:85042628274

SN - 9789811061462

SP - 21

EP - 41

BT - Combinatorial Optimization and Graph Algorithms

PB - Springer

ER -

Graph stabilization: A survey

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this