the 5 graph is a spanner
play

The 5 -graph is a spanner Prosenjit Bose, Pat Morin, Andr e van - PowerPoint PPT Presentation

Mar 30, 2024 •348 likes •1.11k views

The 5 -graph is a spanner Prosenjit Bose, Pat Morin, Andr e van Renssen and Sander Verdonschot Carleton University June 20, 2013 Sander Verdonschot (Carleton University) The 5 -graph is a spanner June 20, 2013 1 / 19 -graphs

  1. The θ 5 -graph is a spanner Prosenjit Bose, Pat Morin, Andr´ e van Renssen and Sander Verdonschot Carleton University June 20, 2013 Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 1 / 19

  2. θ -graphs Partition plane into k cones Add edge to ‘closest’ vertex in each cone Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 2 / 19

  3. Geometric Spanners Graphs with short detours between vertices For every u and w , there is a path with length ≤ t · | uw | Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 3 / 19

  4. Previous Work Clarkson 1987 θ -graphs with k > 8 are (1 + ε )-spanners Keil 1988 Ruppert & Seidel 1991 θ -graphs with k > 6 have spanning ratio 1 1 − 2 sin( θ/ 2) Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 4 / 19

  5. Previous Work Clarkson 1987 θ -graphs with k > 8 are (1 + ε )-spanners Keil 1988 Ruppert & Seidel 1991 θ -graphs with k > 6 have spanning ratio 1 1 − 2 sin( θ/ 2) El Molla 2009 θ 2 and θ 3 are not spanners Bonichon et al. 2010 θ 6 is a planar 2-spanner Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 4 / 19

  6. Previous Work Clarkson 1987 θ -graphs with k > 8 are (1 + ε )-spanners Keil 1988 Ruppert & Seidel 1991 θ -graphs with k > 6 have spanning ratio 1 1 − 2 sin( θ/ 2) El Molla 2009 θ 2 and θ 3 are not spanners Bonichon et al. 2010 θ 6 is a planar 2-spanner What about θ 4 and θ 5 ? Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 4 / 19

  7. θ 5 Challenges Asymmetric Steps can get further away w v u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 5 / 19

  8. θ 5 Challenges Asymmetric Steps can get further away w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 5 / 19

  9. Connectedness Induction on size of canonical triangle w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 6 / 19

  10. Connectedness Base case: smallest canonical triangle w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  11. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case1: w lies near the bisector w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  12. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  13. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  14. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  15. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  16. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w v w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  17. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w v w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  18. Connectedness Base case: smallest canonical triangle IH: There exists a path between every two vertices with a smaller canonical triangle Case2: w lies far from the bisector w v w u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 7 / 19

  19. Spanning Ratio - Strategy Find a vertex v with A path w � v shorter than a · |△ uw | w u v Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 8 / 19

  20. Spanning Ratio - Strategy Find a vertex v with A path w � v shorter than a · |△ uw | A canonical triangle smaller than b · |△ uw | w u v Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 8 / 19

  21. Spanning Ratio - Strategy Find a vertex v with A path w � v shorter than a · |△ uw | A canonical triangle smaller than b · |△ uw | Then there is a path u � w shorter than c · |△ uw | w u v Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 8 / 19

  22. Spanning Ratio - Cases w 3 4 2 u 1 Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 9 / 19

  23. Spanning Ratio - Case 1 w Case 1 u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 10 / 19

  24. Spanning Ratio - Case 1 w Case 1 w � v ≤ a · |△ uw | u v w Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 10 / 19

  25. Spanning Ratio - Case 1 w Case 1 w � v ≤ a · |△ uw | |△ uv | ≤ b · |△ uw | u v w Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 10 / 19

  26. Spanning Ratio - Case 1 w Case 1 w � v ≤ a · |△ uw | |△ uv | ≤ b · |△ uw | Done! u v w Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 10 / 19

  27. Spanning Ratio - Case 2 & 3 w Works for Case 2 and 3. 3 2 u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 11 / 19

  28. Spanning Ratio - Case 4 w Case 4 v u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  29. Spanning Ratio - Case 4 w Case 4 Our strategy doesn’t v work everywhere u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  30. Spanning Ratio - Case 4 w Case 4 Our strategy doesn’t work everywhere v But it does work in a large part u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  31. Spanning Ratio - Case 4 w Case 4 Our strategy doesn’t work everywhere But it does work in a large part Left with a small region that we can’t solve u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  32. Spanning Ratio - Case 4 w Case 4 Our strategy doesn’t work everywhere But it does work in a large part Left with a small region that we can’t solve u What about v u ? Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  33. Spanning Ratio - Case 4 w Case 4 e b Our strategy doesn’t d work everywhere c But it does work in a large part Left with a small region that we can’t solve u What about v u ? Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 12 / 19

  34. Spanning Ratio - Case 4b Case 4b w � v ≤ a · |△ uw | w v |△ uv | ≤ b · |△ uw | Done! u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 13 / 19

  35. Spanning Ratio - Case 4c w Case 4c Convert to worst-case v u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 14 / 19

  36. Spanning Ratio - Case 4c w Case 4c Convert to worst-case v u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 14 / 19

  37. Spanning Ratio - Case 4c w Case 4c Convert to worst-case w � v ≈ 0 |△ uv | ≈ |△ uw | Done! u ≈ v Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 14 / 19

  38. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

  39. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

  40. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

  41. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

  42. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

  43. Spanning Ratio - Case 4d w Case 4d Convert to worst-case v w v u u Sander Verdonschot (Carleton University) The θ 5 -graph is a spanner June 20, 2013 15 / 19

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Geometric Spanner Networks Course Outline Textbook Introduction Algorithms Review Greedy

Geometric Spanner Networks Course Outline Textbook Introduction Algorithms Review Greedy

Geometric Spanner Networks Geometric Spanner Networks Course Outline Textbook Introduction Algorithms Review Greedy Algorithm (Org. and Imp.) Apx. Greedy Algorithm (Ordered) -Graph Algorithm (Sink and Spring 2014 Skip-list spanner)

1.33k views • 103 slides
Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A

Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A

Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A multi-version, globally-distributed, synchronously-replicated database - First system to - Distribute data globally - Externally-consistent

619 views • 29 slides
Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook

Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook

Geometric Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook Introduction Combinatorial and Geometric ALGorithms (CGALG) Lab., Algorithms Review Department of Computer Science, Greedy Algorithm

1.53k views • 103 slides
Cloud Spanner Rohit Gupta, Solutions Engineer @rohitforcloud Todays goals Provide a brief

Cloud Spanner Rohit Gupta, Solutions Engineer @rohitforcloud Todays goals Provide a brief

Cloud Spanner Rohit Gupta, Solutions Engineer @rohitforcloud Todays goals Provide a brief history of Spanner at Google Provide an explanation of Cloud Spanner Do a demo! Built on the same infrastructure that powers Google Always

299 views • 25 slides
2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today

2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today

2PC, Linearizability, Spanner 2020-04-17 Nikita Borisov - UIUC 12 Topics for Today Two-phase commit Atomic commit protocol Crash-recovery, durability External consistency / linearizability Spanner Multi-version database

440 views • 16 slides
Spanner: Googles Globally-Distributed Database Wilson Hsieh representing a host of authors

Spanner: Googles Globally-Distributed Database Wilson Hsieh representing a host of authors

Spanner: Googles Globally-Distributed Database Wilson Hsieh representing a host of authors OSDI 2012 What is Spanner? Distributed multiversion database General-purpose transactions (ACID) SQL query language Schematized tables

648 views • 27 slides
Spanner Stephanie New Overview Scalable, multi-version, globally distributed, and synchronously

Spanner Stephanie New Overview Scalable, multi-version, globally distributed, and synchronously

Spanner Stephanie New Overview Scalable, multi-version, globally distributed, and synchronously replicated database. Supports non-blocking reads in the past, lock-free read-only transactions, and atomic schema changes. To support externally

1.64k views • 13 slides
Spanner Doug Woos (based on slides by Dan Ports) Bigtable in retrospect Definitely a useful,

Spanner Doug Woos (based on slides by Dan Ports) Bigtable in retrospect Definitely a useful,

Spanner Doug Woos (based on slides by Dan Ports) Bigtable in retrospect Definitely a useful, scalable system! Still in use at Google, motivated lots of NoSQL DBs Biggest mistake in design (per Jeff Dean, Google): not supporting

653 views • 21 slides
A Spanner for the Day After Kevin Buchin 1 Sariel Har-Peled 2 ah 1 D aniel Ol 1 Eindhoven

A Spanner for the Day After Kevin Buchin 1 Sariel Har-Peled 2 ah 1 D aniel Ol 1 Eindhoven

A Spanner for the Day After Kevin Buchin 1 Sariel Har-Peled 2 ah 1 D aniel Ol 1 Eindhoven University of Technology 2 University of Illionis at Urbana-Champaign u d e t n S t n P o r e i t s a e t n Geometric spanners V

853 views • 67 slides
Spanner A distributed database system Presented by Yue Xia Background - Developed by Google

Spanner A distributed database system Presented by Yue Xia Background - Developed by Google

Spanner A distributed database system Presented by Yue Xia Background - Developed by Google initially as a key-value storage system - Developers want traditional database features like query language - Evolved to a full featured SQL

718 views • 48 slides
External Consistency and Spanner CS425/ECE428 SPRING 2020 NIKITA BORISOV, UIUC Transactions

External Consistency and Spanner CS425/ECE428 SPRING 2020 NIKITA BORISOV, UIUC Transactions

External Consistency and Spanner CS425/ECE428 SPRING 2020 NIKITA BORISOV, UIUC Transactions so far Objects distributed / partitioned among different servers For load balancing (sharding) For separation of concerns /

748 views • 31 slides
Bigtable, Spanner and Flat Datacenter Storage by Onur Karaman and Karan Parikh Introducing

Bigtable, Spanner and Flat Datacenter Storage by Onur Karaman and Karan Parikh Introducing

Bigtable, Spanner and Flat Datacenter Storage by Onur Karaman and Karan Parikh Introducing Bigtable Why Bigtable? Store lots of data Scalable Simple yet powerful data model Flexible workloads: high throughput batch jobs to

666 views • 47 slides
Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer

Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer

Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer How to build a planet-scale serializable database Build clocks with bounded absolute error, and integrate them with timestamp assignment:

722 views • 34 slides
Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to traverse every Tyler Moore edge and vertex in a graph. CSE 3353, SMU, Dallas, TX For correctness, we must do the traversal in a systematic way so

736 views • 5 slides
GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan*

GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan*

Graph Mining and Graph Kernels GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan* ^University of Cambridge *IBM T. J. Watson Research Center August 24, 2008 | ACM SIG KDD, Las Vegas Graph Mining and Graph

1.28k views • 60 slides
Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph

Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph

Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph Computation Think like a vertex Linear algebra Graph Search Find instances of path expressions Graph Mining Mine patterns of

436 views • 16 slides
Spanning connectivity of graphs Elkin Vumar College of Mathematics and System Sciences Xinjiang

Spanning connectivity of graphs Elkin Vumar College of Mathematics and System Sciences Xinjiang

Introduction Some known results Some open problems and conjectures Thanks References Spanning connectivity of graphs Elkin Vumar College of Mathematics and System Sciences Xinjiang University, P .R. China Shanghai Jiaotong University,

609 views • 47 slides
Nonlinear Signal Processing 2007-2008 Connectedness and compactness (Ch.4, Introduction to

Nonlinear Signal Processing 2007-2008 Connectedness and compactness (Ch.4, Introduction to

Nonlinear Signal Processing 2007-2008 Connectedness and compactness (Ch.4, Introduction to Topological Manifolds, J. Lee, Springer-Verlag) Instituto Superior T ecnico, Lisbon, Portugal Jo ao Xavier jxavier@isr.ist.utl.pt

243 views • 20 slides
Visual Design Visual Design Objectives Gestalt Principles Creating Organization and Structure

Visual Design Visual Design Objectives Gestalt Principles Creating Organization and Structure

Visual Design Visual Design Objectives Gestalt Principles Creating Organization and Structure Typography UI Visual Design Objectives What are the goals of an effective interface? Information communication 1. - enforce desired relationships

455 views • 34 slides
An evolution of a permutation Huseyin Acan April 28, 2014 Joint work with Boris Pittel Notation

An evolution of a permutation Huseyin Acan April 28, 2014 Joint work with Boris Pittel Notation

An evolution of a permutation Huseyin Acan April 28, 2014 Joint work with Boris Pittel Notation and Definitions S n is the set of permutations of { 1 , . . . , n } Notation and Definitions S n is the set of permutations of { 1 , . . . ,

1.24k views • 86 slides
Critical connectedness of thin arithmetical discrete planes Timo Jolivet Universit Paris

Critical connectedness of thin arithmetical discrete planes Timo Jolivet Universit Paris

Critical connectedness of thin arithmetical discrete planes Timo Jolivet Universit Paris Diderot, France University of Turku, Finland Joint work with Valrie Berth , Damien Jamet , Xavier Provenal (Powered by ANR KIDICO) DGCI 2013 El

866 views • 85 slides
Connected components of the moduli of elliptic K 3 surfaces Ichiro Shimada Hiroshima University

Connected components of the moduli of elliptic K 3 surfaces Ichiro Shimada Hiroshima University

Introduction Definitions Main result Examples Miranda-Morrison theory Connected components of the moduli of elliptic K 3 surfaces Ichiro Shimada Hiroshima University 2016 November Chamb ery 1 / 27 Introduction Definitions Main result

596 views • 27 slides
Colocally connected, Non-cut, Non- block and Shore sets in Hyperspaces and Symmetric Products

Colocally connected, Non-cut, Non- block and Shore sets in Hyperspaces and Symmetric Products

Colocally connected, Non-cut, Non- block and Shore sets in Hyperspaces and Symmetric Products Vernica Mar+nez de la Vega Jorge M Mar+nez Montejano XV Workshope on Con;nuum Theory and Dynamics Systems North Bay, ON 2018 Colocally connected,

1.3k views • 126 slides
Using IP to Underpin 5G Networks Making the Unreliable Reliable Adrian Farrel

Using IP to Underpin 5G Networks Making the Unreliable Reliable Adrian Farrel

Using IP to Underpin 5G Networks Making the Unreliable Reliable Adrian Farrel adrian@olddog.co.uk 28th IEEE International Conference on Network Protocols October 13 th , 2020 OLD DOG CONSULTING Topics What Services do we Want to Enable?

407 views • 14 slides

More recommend