Pages that link to "Item:Q627197"

The following pages link to The surviving rate of an outerplanar graph for the firefighter problem (Q627197):

Displaying 10 items.

• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
• The firefighter problem: empirical results on random graphs (Q337557) (← links)
• The 2-surviving rate of planar graphs without 6-cycles (Q391779) (← links)
• The surviving rate of digraphs (Q396728) (← links)
• A note on the surviving rate of 1-planar graphs (Q512598) (← links)
• The surviving rate of an infected network (Q708218) (← links)
• The 2-surviving rate of planar graphs without 4-cycles (Q714853) (← links)
• The surviving rate of planar graphs (Q764317) (← links)
• Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
• Solving the geometric firefighter routing problem via integer programming (Q1755409) (← links)