๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Surviving Rate of a Graph for the Firefighter Problem

โœ Scribed by Leizhen, Cai; Weifan, Wang


Book ID
118197013
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
213 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The surviving rate of planar graphs
โœ Jiangxu Kong; Weifan Wang; Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB
A modified noising algorithm for the gra
โœ V. Sudhakar; C. Siva Ram Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 804 KB

Many heuristics such as iterative improvement and simulated annealing are available in the literature which try to give a near-optimal solution to the graph partitioning problem. Recently, a new method called the noising method has been proposed for solving combinatorial optimization problems. The n