The firefighter problem: saving sets of vertices on cubic graphs

DOI10.1002/NET.21873MaRDI QIDQ5226588zbMATH OpenOpenAlexWikidataFDO

Authors Christopher Duffy, Gary MacGillivray

Publication date 1 August 2019

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11343/285460

zbMATH Keywords

algorithmscomplexitydiscrete-time processfirefightergraph processgraph theory

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35)

Recommendations

• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• scientific article; zbMATH DE number 2061798
• The firefighter problem on graph classes
• The firefighter problem with more than one firefighter on trees

Cited in

(5)

• Surviving rate of graphs and firefighter problem
• The firefighter problem for graphs of maximum degree three
• The firefighter problem with subdividing edges on graphs of maximum degree three
• The burning of the snark
• The firefighter problem for cubic graphs

This page was built for publication: The firefighter problem: saving sets of vertices on cubic graphs

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