scholarly journals Strategy on Disaster Recovery Management based on Graph Theory Concepts

Author(s):  
Jerlin Seles M ◽  
◽  
Dr. U. Mary ◽  

The COVID-19 pandemic has asserted major baseline facts from disaster anthropology during the last three decades. Resilience could be based on the solution to the question: "What is the maximum amount of destruction, if any, that the graph (a network) can sustain while ensuring that at least one of each technology type remains and that the remaining induced subgraph is properly colored?" The concept of a graph's Chromatic Core Subgraph is a solution to the stated problem. In this paper, the pandemic graphs and certain sequential graphs are developed. For these graphs, the Chromatic core subgraph is obtained. The results of the pandemic graphs' Chromatic core subgraph are used to develop a disaster recovery strategy for the COVID-19 pandemic.

2007 ◽  
Vol 2 (6) ◽  
pp. 517-529 ◽  
Author(s):  
Laurie A. Johnson ◽  

Few local governments in the U.S. have faced the difficult task of managing catastrophic disaster recovery and there are equally few training guides geared toward improving local government's recovery management capacity. Our limited "toolkit"for local recovery management mostly reflects the learning from more moderate disasters. This paper reports on New Orleans' experiences in managing recovery from a truly catastrophic disaster. In particular, it describes two efforts: the 5-month Unified New Orleans Plan process, initiated in September 2006, and the city's Office of Recovery Management (now Office of Recovery Development and Administration), established in December 2006. It analyzes New Orleans' use of seven strategic recovery management practices that are proposed to enhance local management capacity and effectiveness following a disastrous event. Given the scale, complexity and multiple agencies involved in New Orleans recovery, this analysis is by no means exhaustive. It does, however, illustrate some of the areas where New Orleans' recovery management efforts have been effective as well as areas that could be strengthened.


2014 ◽  
Vol 30 (1) ◽  
pp. 577-605 ◽  
Author(s):  
Laurie A. Johnson ◽  
Ljubica Mamula-Seadon

Large-scale disasters simultaneously deplete capital stock and services which then requires many complex rebuilding and societal activities to happen in a compressed time period; one of those is governance. Governments often create new institutions or adapt existing institutions to cope with the added demands. Over two years following the 4 September 2010 and 22 February 2011 Canterbury earthquakes, governance transformations have increasingly centralized recovery authority and operations at the national level. This may have helped to strengthen coordination among national agencies and expedite policy and decision making; but the effectiveness of coordination among multiple levels of government, capacity building at the local and regional levels, and public engagement and deliberation of key decisions are some areas where the transformations may not have been as effective. The Canterbury case offers many lessons for future disaster recovery management in New Zealand, the United States, and the world.


2008 ◽  
Vol Vol. 10 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Marina Groshaus ◽  
Jayme Luiz Szwarcfiter

Graphs and Algorithms International audience In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively. A natural question is to determine for which graphs the corresponding Helly property holds, for every induced subgraph. This leads to the corresponding classes of hereditary clique-Helly, hereditary disk-Helly, hereditary biclique-Helly and hereditary neighbourhood-Helly graphs. In this paper, we describe characterizations in terms of families of forbidden subgraphs, for the classes of hereditary biclique-Helly and hereditary neighbourhood-Helly graphs. We consider both open and closed neighbourhoods. The forbidden subgraphs are all of fixed size, implying polynomial time recognition for these classes.


Sign in / Sign up

Export Citation Format

Share Document