scientific article; zbMATH DE number 5575583

MaRDI QIDQ3635574zbMATH OpenFDO

Authors Jean R. S. Blair, Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Fredrik Manne, Douglas F. Rall

Publication date 6 July 2009

zbMATH Keywords

dominating setemegency responsefacilty placementree algorithmsweak k-response

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Recommendations

• Incremental and fully dynamic subgraph connectivity for emergency planning
• Distributed Evacuation in Graphs with Multiple Exits
• Covering-Location Models for Emergency Situations That Require Multiple Response Units
• scientific article; zbMATH DE number 3943547
• The optimal rescue path set problem in undirected graphs
• Resource allocation in state-dependent emergency evacuation networks
• Modeling emergency response operations: a theory building survey

Cited in

(1)

• An heuristic algorithm for handling multiple responses

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635574)