@inbook{0720ac8901a24a95b8ead1d3e11b97bf,

title = "Application of semidefinite programming to maximize the spectral gap produced by node removal",

abstract = "The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks.",

keywords = "Combinatorial optimization, Eigenvalue, Laplacian, Network, Opinion formation, Random walk, Synchronization",

author = "Naoki Masuda and Tetsuya Fujie and Kazuo Murota",

year = "2013",

doi = "10.1007/978-3-642-36844-8_15",

language = "English",

isbn = "9783642368431",

series = "Studies in Computational Intelligence",

publisher = "Springer Verlag",

pages = "155--163",

booktitle = "Complex Networks IV",

}