✦ 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
DOI: 10.1137/070700395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The surviving rate of an outerplanar gra

The surviving rate of an outerplanar graph for the firefighter problem

✍ Weifan Wang; Xubin Yue; Xuding Zhu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Surviving Rates of Graphs with Bounded T

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

✍ Cai, Leizhen; Cheng, Yongxi; Verbin, Elad; Zhou, Yuan 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 463 KB

The surviving rate of planar graphs

✍ Jiangxu Kong; Weifan Wang; Xuding Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 257 KB

The 2-surviving rate of planar graphs wi

The 2-surviving rate of planar graphs without 4-cycles

✍ Wang, Weifan; Kong, Jiangxu; Zhang, Lianzhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Algorithm for the graph-partitioning pro

Algorithm for the graph-partitioning problem using a problem transformation method

✍ M. Meknassi; E.M. Aboulhamid; E. Cerny 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A modified noising algorithm for the gra

A modified noising algorithm for the graph partitioning problem

✍ 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