1 / 35

Several Graph Layout Problems for Grids

Several Graph Layout Problems for Grids. Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach. Graph layout problems. A large number of theoretical and practical problems in various areas may be formulated as graph layout problems.

desireeh
Télécharger la présentation

Several Graph Layout Problems for Grids

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. Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach

  2. Graph layout problems A large number of theoretical and practical problems in various areas may be formulated as graph layout problems.

  3. Graph layout problems

  4. Graph layout problems (MINCUT)

  5. Graph layout problems (Bisection)

  6. Graph layout problems (Bandwidth)

  7. Applications Such problems arise in connection with: • VLSI circuit design, • graph drawing, • embedding problems, • numerical analysis, • optimization of networks for parallel computer architectures.

  8. History Historically, bandwidth was the the first layout problem, as a means to speed up several computations on sparse matrices during the fifties. The bandwidth problem for graphs was first posed as an open problem during a graph theoretical meeting in 1967 by Harary. For more detailed survey of graph layout problems see. The Minimal Cutwidth Linear Arrangement problem (MINCUT) was first used in the seventies as a theoretical model for the number of channels in an optimal layout of a circuit [Adolphson and Hu 1973]

  9. Known Results All above problems are NP-hard in general, MINCUT remains NP-hard even when restricted, for example, to • polynomially (edge-) weighted trees • planar graphs with maximum degree 3. MINCUT remains NP-hard even when restricted, for example, to • trees, with maximum degree 3

  10. Known Results (table)

  11. Known Results (table)

  12. Known Results (table)

  13. Grids

  14. Grids (example)

  15. Toroidal Grids (example)

  16. Location Matrix

  17. Location Matrix

  18. Double Monotonic

  19. Double Monotonic

  20. Main Results

  21. Main Lemma (non toroidal grids)

  22. Our Approach

  23. Our Approach (cont.)

  24. Prof of lower bound

  25. Prof of lower bound

  26. Constructions (upper bounds)

  27. Main Lemma (toroidal grids)

  28. Lower Boundsfor square toroidal grids

  29. Lower Boundsfor square toroidal grids

  30. Lower Boundsfor square toroidal grids

  31. Constructions (upper bounds) for square toroidal grids

  32. Constructions (upper bounds) for square toroidal grids

  33. Lower Boundsfor rectangular toroidal grids

  34. Constructions (upper bounds) for rectangular toroidal grids

  35. The End

More Related