1 / 20

Fighting the Plane

Fighting the Plane. Patricia Fogarty University of Vermont January 17, 2003. Abstract.

nami
Télécharger la présentation

Fighting the Plane

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fighting the Plane Patricia Fogarty University of Vermont January 17, 2003

  2. Abstract Given any type of grid and k firefighters, suppose that a fire breaks out at one of the vertices. At the next time interval, we protect k vertices, and then the fire spreads to any unprotected vertices. We want to find patterns with these grids, and from these, we can determine the minimum number of vertices burned in rectangular grids and in the plane.

  3. Main Idea • How does it work? • A fire starts at some vertex in the grid

  4. Then k firefighters protect vertices in the grid • let k = 1

  5. Then the fire spreads to all adjacent vertices

  6. Objective • build walls that will allow us to protect the whole grid • protect the grid so that a minimum number of vertices burn

  7. Here n = 10 Rectangular Grids • One firefighter • Restrict the y-coordinate to go from 0 to n • Let the x-coordinate extend to infinity

  8. What does this look like? How can we protect the grid First pattern: protect one side at a time Once one side is completely protected we go to the second Let’s start at the top

  9. Second Pattern • Protect the left side of the grid • Protect the right side of the grid • Alternate between these two sides

  10. Start somewhere else • Does the first pattern hold?

  11. Start somewhere else • Does the second pattern hold?

  12. The Plane • Now we are unrestricted in the y-coordinate • i.e. The Cartesian Plane • Can we contain the fire with one firefighter?

  13. Can we contain the fire with two firefighters? How long does it take? The Plane

  14. The Plane Pattern • Protect the bottom portion • Protect the upper portion • Takes 8 time intervals

  15. Protecting the Plane Later • What happens when we do not protect the grid for x time intervals? • Can we protect the grid with two firefighters? • look at x = 1

  16. How long does it take? 32x+1 How many vertices are burned? 318x2+14x+1 x = 1 and conclusions

  17. Connections • Virus Control on Networks • Wildfires • Dennis E. Shasha. Wildfires. Dr. Dobb’s Journal, January 2001, pages 193-194

  18. More Research • The quarter plane • More than one fire • Hexagonal grids • 3D grids

  19. Bibliography • Ping Wang and Stephanie A. Moeller. Fire Control on Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 41, pages 19-34, 2000. • A.S. Finbow and B.L. Hartnell. On designing a network to defend against random attacks on radius two. Networks, 19: 771-792, 1989. • G. Gunther and B.L. Hartnell. Graphs with isomorphic survivor graphs. Congressus Numerantium 79, pages 69-77, 1990. • B.L. Hartnell. The optimum defense against random subersions in a network. Congressus Numerantium 24, pages 493-499, 1979.

  20. Contact Information • Email: pfogarty@emba.uvm.edu • Web page: www.emba.uvm.edu/~pfogarty/ • Follow links to fire control on graphs applet

More Related