The original formulation of the firefighter problem defines a discrete-time process where fire starts at designated subset vertices graph G. At each subsequent discrete time unit, propagates from burnt vertex to all its neighbors unless they are defended by that can move between any pair in single unit. Once is or defended, it remains state, and terminates when no longer spread. In this work, w...

entrosomes are required for cytokinesis and are important in cell cycle progression—but how are centrosomes connected to these essential cellular functions at the molecular level? On page 535, Gromley et al. describe the maternal cen-triole protein centriolin, the first integral centrosome protein linked to both cytokinesis and cell cycle progression in vertebrate cells. Overexpression, siRNA s...

In this paper, we consider the firefighter problem on a graph G = (V,E) that is either finite or infinite. Suppose that a fire breaks out at a given vertex v ∈ V . In each subsequent time unit, a firefighter protects one vertex which is not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as...

OBJECTIVES We conducted a systematic review and meta-analysis to evaluate potential associations between firefighting and police occupations, and prostate cancer incidence and mortality. METHODS Original epidemiological studies published from 1980 to 2017 were identified through PubMed and Web of Science. Studies were included if they contained specific job titles for ever/never firefighting ...

We provide approximation algorithms for several variants of the Firefighter problem on general graphs. The Firefighter problem models the case where a diffusive process such as an infection (or an idea, a computer virus, a fire) is spreading through a network, and our goal is to contain this infection by using targeted vaccinations. Specifically, we are allowed to vaccinate at most a fixed numb...

The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be placed on an unburned vertex, permanently protecting it, and the fire spreads to all neighboring unprotected vertices of burning vertices. The goal is to let as few vertices burn as possible. This probl...

Title of Document: AN EXPERIMENTAL ANALYSIS OF FIREFIGHTER PROTECTIVE CLOTHING: THE INFLUENCES OF MOISTURE AND A THERMALLY ACTIVATED EXPANDING AIR-GAP. James Patrick White, Master of Science, 2012 Directed By: Professor, Marino di Marzo, Department of Fire Protection Engineering Thermally protective clothing garments are necessary pieces of equipment that ensure the life safety of firefighters....

The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be permanently placed on an unburned vertex and the fire spreads to its neighborhood in the graph in so far no firefighters are protecting those vertices. The goal is to let as few vertices burn as possibl...

The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as possible. The surviving rate of a graph is the average percentag...

BACKGROUND Firefighting is a highly stressful occupation with unique physical challenges, apparel and environments that increase the potential for dehydration. Dehydration leaves the firefighter at risk of harm to their health, safety and performance. The purpose of this review was to critically analyse the current literature investigating the impact of fighting 'live' fires on firefighter hydr...