finding your way in a graph finding your way in a graph
play

Finding your way in a graph Finding your way in a graph Finding - PowerPoint PPT Presentation

Nov 29, 2022 •466 likes •2.13k views

Finding your way in a graph Finding your way in a graph Finding your way in a graph Finding your way in a graph = station One loop = junction A system of interconnected loops L L What is the best way to go from L to ? L L L 1 ? L

  1. 110 111 000 a 001 010 011 100 b f e c 100 011 101 110 d 111 001 000 G

  2. A valid addressing of G. 110 111 000 e d a 001 010 011 c f 100 b f e c 100 011 101 110 d a b 111 001 000 G

  3. 110 111 000 e d a 001 010 011 c f 100 b f e c 100 011 101 110 d a b 111 001 000 G 000 a 001 010 b f An invalid addressing e c 011 110 d 111 G

  4. Trees e a d b f c g A tree T

  5. Trees e a a - 0 b - 1 d b f So far, so good! c g A tree T

  6. Trees e a a - 0 0 b - 1 0 d b f c - 1 1 c g A tree T

  7. Trees e a a - 0 0 0 b - 1 0 0 d b f c - 1 1 0 d - 1 0 1 c g A tree T

  8. Trees e a a - 0 0 0 0 b - 1 0 0 0 d b f c - 1 1 0 0 d - 1 0 1 0 c g e - 1 0 1 1 A tree T

  9. Trees e a a - 0 0 0 0 0 b - 1 0 0 0 0 d b f c - 1 1 0 0 0 d - 1 0 1 0 0 c g e - 1 0 1 1 0 f - 1 0 1 0 1 A tree T

  10. Trees e a a - 0 0 0 0 0 0 b - 1 0 0 0 0 0 d b f c - 1 1 0 0 0 0 d - 1 0 1 0 0 0 c g e - 1 0 1 1 0 0 f - 1 0 1 0 1 0 g - 1 0 1 0 1 1 A tree T

  11. Trees e a a - 0 0 0 0 0 0 b - 1 0 0 0 0 0 d b f c - 1 1 0 0 0 0 d - 1 0 1 0 0 0 c g e - 1 0 1 1 0 0 f - 1 0 1 0 1 0 g - 1 0 1 0 1 1 A tree T A valid addressing of T

  12. Now we can address a triangle What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  13. Now we can address a triangle What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  14. Now we can address a triangle What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  15. Now we can address a triangle What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  16. 0 0 Now we can address a triangle 0 1 What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  17. 0 0 Now we can address a triangle 1 * 0 1 What about a triangle ? ? Introduce a new symbol * , and define d (0,*) = d (1,*) = 0. H H For example, d (0 1 * 0 * 1 0 1, * 0 1 * * 0 1 1) = 3 H

  18. A valid extended addressing of G is an assignment A(v) to each vertex v in G an N-tuple of 0, 1, and *’s so that for all vertices u and v in G, d (u,v ) = d (A(u),A(v)) H G Theorem: Valid extended addresses exist for every graph G.

  19. A valid extended addressing of G is an assignment A(v) to each vertex v in G an N-tuple of 0, 1, and *’s so that for all vertices u and v in G, d (u,v ) = d (A(u),A(v)) H G Theorem: Valid extended addresses exist for every graph G.

  20. Proof: d (v ,v ) 1 2 G { A(v ) = 0......0 1 A(v ) = 1……1 2

  21. Proof: d (v ,v ) 1 2 d (v ,v ) 1 3 G G { { A(v ) = 0......0 0……0 1 A(v ) = 1……1 *……* 2 A(v ) = *……* 1……1 3

  22. Proof: d (v ,v ) 1 2 d (v ,v ) d (v ,v ) 1 3 G G i j G { { { A(v ) = 0......0 0……0……………………*……*……………… 1 A(v ) = 1……1 *……*…………………….*……*……………… 2 A(v ) = *……* 1……1…………………….*……*……………… 3 . . . . A(v ) = *……* *……*…………………….0……0……………… i . . . . . A(v ) = *……* *……*…………………….1……1……………… j . . . .

  23. Unfortunately, the length of the addresses maybe very long by using this method! Define N(G) to be the least N such that a valid (extended) addressing of G of length N exists. Conjecture: If G has n vertices then N(G) ! n – 1. Conjecture:

  24. Unfortunately, the length of the addresses maybe very long by using this method! Define N(G) to be the least N such that a valid (extended) addressing of G of length N exists. Conjecture: If G has n vertices then N(G) ! n – 1. Conjecture:

  25. Unfortunately, the length of the addresses maybe very long by using this method! Define N(G) to be the least N such that a valid (extended) addressing of G of length N exists. Conjecture: If G has n vertices then N(G) ! n – 1. Conjecture: Theorem (Peter Winkler) Theorem

  26. Unfortunately, the length of the addresses maybe very long by using this method! Define N(G) to be the least N such that a valid (extended) addressing of G of length N exists. Conjecture: If G has n vertices then N(G) ! n – 1. Conjecture: Theorem (Peter Winkler - $100) Theorem

  27. Unfortunately, the length of the addresses maybe very long by using this method! Define N(G) to be the least N such that a valid (extended) addressing of G of length N exists. Conjecture: If G has n vertices then N(G) ! n – 1. Conjecture: Theorem (Peter Winkler - $100) Theorem

  28. A A B C D E F . . . . . . . A 0 1 1 2 2 3 . . . . . . . B 1 0 1 1 2 2 C B . . . . . . . C 1 1 0 2 1 2 . . . . . . . D 2 1 2 0 2 1 D E . . . . . . . 2 2 1 2 0 1 E F . . . . . . . F 3 2 2 1 1 0 . . . . . . . Distance matrix D(G) = (d ) ij

  29. A vertex - address A B C D E F . . . . . . . A 0 1 1 2 2 3 A - 0 0 0 0 0 . . . . . . . B 1 0 1 1 2 2 C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C 1 1 0 2 1 2 . . . . . . . D 2 1 2 0 2 1 D - 1 * 1 D E * 0 . . . . . . . 2 2 1 2 0 1 E E - 0 1 0 1 * F . . . . . . . F 3 2 2 1 1 0 F - * * 1 1 1 . . . . . . . Distance matrix D(G) = (d ) ij

  30. A vertex - address A B C D E F . . . . . . . A 0 1 1 2 2 3 A - 0 0 0 0 0 . . . . . . . B 1 0 1 1 2 2 C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C 1 1 0 2 1 2 . . . . . . . D 2 1 2 0 2 1 D - 1 * 1 D E * 0 . . . . . . . 2 2 1 2 0 1 E E - 0 1 0 1 * F . . . . . . . F 3 2 2 1 1 0 F - * * 1 1 1 . . . . . . . Distance matrix D(G) = (d ) ij

  31. A vertex - address A B C D E F . . . . . . . A 1 1 A - 0 0 0 0 0 . . . . . . . B C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C 1 1 . . . . . . . D D - 1 * 1 D E * 0 . . . . . . . E 1 1 E - 0 1 0 1 * F . . . . . . . F F - * * 1 1 1 . . . . . . .

  32. A vertex - address A B C D E F . . . . . . . A 1 1 A - 0 0 0 0 0 . . . . . . . B C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C 1 1 . . . . . . . D D - 1 * 1 D E * 0 . . . . . . . E 1 1 E - 0 1 0 1 * F . . . . . . . F F - * * 1 1 1 . . . . . . . A C E x B D

  33. A vertex - address A B C D E F . . . . . . . A A - 0 0 0 0 0 . . . . . . . B C B 1 B - 1 * 0 0 * 1 1 . . . . . . . C - 0 1 0 0 * C . . . . . . . D 1 1 D - 1 * 1 1 D E * 0 . . . . . . . E E - 0 1 0 1 * F . . . . . . . F F - * * 1 1 1 . . . . . . . A C E x B D = B D x A C E

  34. A vertex - address A B C D E F . . . . . . . A 1 1 A - 0 0 0 0 0 . . . . . . . B C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C . . . . . . . D D - 1 * 1 D E * 0 . . . . . . . E E - 0 1 0 1 * F . . . . . . . F F - * * 1 1 1 . . . . . . . A x C E

  35. A vertex - address A B C D E F . . . . . . . A 0 1 1 2 2 3 A - 0 0 0 0 0 . . . . . . . 1 0 1 1 2 2 B C B B - 1 * 0 0 * . . . . . . . C - 0 1 0 0 * C 1 1 0 2 1 2 . . . . . . . D 2 1 2 0 2 1 D - 1 * 1 D E * 0 . . . . . . . 2 2 1 2 0 1 E E - 0 1 0 1 * F . . . . . . . F 3 2 2 1 1 0 F - * * 1 1 1 . . . . . . . column contribution Distance matrix D(G) = (d ) ij 1 ACE x BD " Q( G ) d xx (x x x )(x x ) = = + + + 12 ij i j 1 3 5 2 4 1 i ,j n 2 A x CE ! ! x (x x ) + + 1 3 5 3 ABCE x DF (x x x x )(x x ) + + + + + 1 2 3 5 4 6 4 ABC x EF (x x x ) x x + + + ( ) + 1 2 3 5 AD x F 5 6 (x x ) x + + 1 4 6

  36. A valid extended addressing of G using N-tuples corresponds exactly to " Q(G) d xx j a decomposition of = into a sum of N terms of form 12 ij i , 1 i j n ! ! (x x ... x )(x x ... x ) . + + + + + + i i i j j j 1 2 r 1 2 s AB [(A B) 2 (A B) ] 2 = + ! ! However, since 1 4 then ! Q(G) (x x ... x )(x x ... x ) = + + + + + + j j j i i i r 1 2 s 1 2 N terms " [(x ... x x ... x ) 2 (x ... x x ... x ) ] 2 + + + + + ! + + ! ! ! 1 = j j j j 4 i i i i r s r s 1 1 1 1 N Thus, Q(G) is congruent to a quadratic form which has N positive squares and N negative squares.

  37. A valid extended addressing of G using N-tuples corresponds exactly to " Q(G) d xx j a decomposition of = into a sum of N terms of form 12 ij i , 1 i j n ! ! (x x ... x )(x x ... x ) . + + + + + + i i i j j j 1 2 r 1 2 s AB [(A B) 2 (A B) ] 2 = + ! ! However, since 1 4 then ! Q(G) (x x ... x )(x x ... x ) = + + + + + + j j j i i i r 1 2 s 1 2 N terms " [(x ... x x ... x ) 2 (x ... x x ... x ) ] 2 + + + + + ! + + ! ! ! 1 = j j j j 4 i i i i r s r s 1 1 1 1 N Thus, Q(G) is congruent to a quadratic form which has N positive squares and N negative squares.

  38. A valid extended addressing of G using N-tuples corresponds exactly to " Q(G) d xx j a decomposition of = into a sum of N terms of form 12 ij i , 1 i j n ! ! (x x ... x )(x x ... x ) . + + + + + + i i i j j j 1 2 r 1 2 s AB [(A B) 2 (A B) ] 2 = + ! ! However, since 1 4 then ! Q(G) (x x ... x )(x x ... x ) = + + + + + + j j j i i i r 1 2 s 1 2 N terms " [(x ... x x ... x ) 2 (x ... x x ... x ) ] 2 + + + + + ! + + ! ! ! 1 = j j j j 4 i i i i r s r s 1 1 1 1 N Thus, Q(G) is congruent to a quadratic form which has N positive squares and N negative squares.

  39. Hence, by Sylvester’s law of inertia, N n (G) ! = number of positive eigenvalues of D(G); + and N n (G) ! = number of negative eigenvalues of D(G); -

  40. Hence, by Sylvester’s law of inertia, N n (G) ! = number of positive eigenvalues of D(G); + and N n (G) ! = number of negative eigenvalues of D(G); - Theorem: (Graham, Pollak, Witsenhausen) Theorem: N(G) max{n (G),n (G)} ! + -

  41. Hence, by Sylvester’s law of inertia, N n (G) ! = number of positive eigenvalues of D(G); + and N n (G) ! = number of negative eigenvalues of D(G); - Theorem: (Graham, Pollak, Witsenhausen) Theorem: N(G) max{n (G),n (G)} ! + -

  42. Hence, by Sylvester’s law of inertia, N n (G) ! = number of positive eigenvalues of D(G); + and N n (G) ! = number of negative eigenvalues of D(G); - Theorem: (Graham, Pollak, Witsenhausen) Theorem: N(G) max{n (G),n (G)} ! + -

  43. Hence, by Sylvester’s law of inertia, N n (G) ! = number of positive eigenvalues of D(G); + and N n (G) ! = number of negative eigenvalues of D(G); - Theorem: (Graham, Pollak, Witsenhausen) Theorem: N(G) max{n (G),n (G)} ! + - Question: How close to the truth is this bound?

  44. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  45. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  46. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  47. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  48. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  49. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  50. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  51. T - a tree with n vertices n T ’’ T ’ T 5 5 5 _ _ _ _ _ _ 0 1 1 1 1 0 1 2 3 4 0 1 2 3 3 1 0 2 2 2 1 0 1 2 3 1 0 1 2 2 1 2 0 2 2 2 1 0 1 2 2 1 0 1 1 1 2 2 0 2 3 2 1 0 1 3 2 1 0 2 _ _ _ _ _ _ 1 2 2 2 0 4 3 2 1 0 3 2 1 2 0 T ’ T ’’ D( ) T 5 D( ) D( ) D( ) 5 5 n = 1 n = 1 n = 1 + + + n = 4 n = 4 n = 4 - - - T ’’ T ’ det = 32 D( ) det = 32 ! D( ) det = 32 !! D( ) D( ) T 5 5 5 A coincidence ? (or an example of the law of small numbers?)

  52. If T is a tree with n vertices then n ) ( ) (n ) 2 -2 n-1 n detD(T = 1 ! 1 ! n independent of the structure of the tree. (T ) , n (T ) n n = 1 = ! 1 This implies n n + - and so, N(T ) n = ! 1 n for any tree T tree with n vertices. n

  53. If T is a tree with n vertices then n ) ( ) (n ) 2 -2 n-1 n detD(T = 1 ! 1 ! n independent of the structure of the tree. (T ) , n (T ) n n = 1 = ! 1 This implies n n + - and so, N(T ) n = ! 1 n for any tree T tree with n vertices. n

  54. Some questions Some questions N(G) max{n (G),n (G)}? = Is it true that + - No! Take G = K . 2,3 n (G) = 2, n (G) = 3, N(G) = 4 - + What is the value of N(K ) in general? s,t (It is between s+t-2 and s+t-1). Why is n (G) so small in general? +

  55. Some questions Some questions N(G) max{n (G),n (G)}? = Is it true that + - No! Take G = K . 2,3 n (G) = 2, n (G) = 3, N(G) = 4 - + What is the value of N(K ) in general? s,t (It is between s+t-2 and s+t-1). Why is n (G) so small in general? +

  56. Some questions Some questions N(G) max{n (G),n (G)}? = Is it true that + - No! Take G = K . 2,3 n (G) = 2, n (G) = 3, N(G) = 4 - + What is the value of N(K ) in general? s,t (It is between s+t-2 and s+t-1). Why is n (G) so small in general? +

  57. Some questions Some questions N(G) max{n (G),n (G)}? = Is it true that + - No! Take G = K . 2,3 n (G) = 2, n (G) = 3, N(G) = 4 - + What is the value of N(K ) in general? s,t (It is between s+t-2 and s+t-1). Why is n (G) so small in general? +

  58. What does det D(G) mean? ) ( ) n-1 (n ) 2 -2 n detD(T = 1 ! 1 For example, ! for any tree T . n n n - 1 is the number of edges in T . n In general, one could look at the characteristic polynomial of D(G), i.e., det (D(G) – xI) (where I denotes the n by n identity matrix). The constant term is just det D(G). What do the other coefficients of det (D(G) – xI) mean? For G = T , we understand them (Graham/Lovász). n For example, the coefficient of x is 4 #( ) + 2 #( ) + 4 #( ) - 4

  59. What does det D(G) mean? ) ( ) n-1 (n ) 2 -2 n detD(T = 1 ! 1 For example, ! for any tree T . n n n - 1 is the number of edges in T . n In general, one could look at the characteristic polynomial of D(G), i.e., det (D(G) – xI) (where I denotes the n by n identity matrix). The constant term is just det D(G). What do the other coefficients of det (D(G) – xI) mean? For G = T , we understand them (Graham/Lovász). n For example, the coefficient of x is 4 #( ) + 2 #( ) + 4 #( ) - 4

  60. What does det D(G) mean? ) ( ) n-1 (n ) 2 -2 n detD(T = 1 ! 1 For example, ! for any tree T . n n n - 1 is the number of edges in T . n In general, one could look at the characteristic polynomial of D(G), i.e., det (D(G) – xI) (where I denotes the n by n identity matrix). The constant term is just det D(G). What do the other coefficients of det (D(G) – xI) mean? For G = T , we understand them (Graham/Lovász). n For example, the coefficient of x is 4 #( ) + 2 #( ) + 4 #( ) - 4

  61. Which graphs have valid addressings which use only 0’s and 1’s (i.e., no *’s)? That is, which graphs can be isometrically embedded in an N-cube? Theorem (Djokovi č ) Theorem G can be isometrically embedded into an N-cube if and only if for every edge {u,v} of G, the set of vertices S(u) which are closer to u than to v is closed under taking shortest paths, i.e., all shortest paths between any two vertices in S(u) stay within S(u). More generally, there is now a rather complete theory as to when graphs can be isometrically embedded in a cartesian product of smaller graphs (Graham/Winkler).

  62. Which graphs have valid addressings which use only 0’s and 1’s (i.e., no *’s)? That is, which graphs can be isometrically embedded in an N-cube? Theorem (Djokovi č ) Theorem G can be isometrically embedded into an N-cube if and only if for every edge {u,v} of G, the set of vertices S(u) which are closer to u than to v is closed under taking shortest paths, i.e., all shortest paths between any two vertices in S(u) stay within S(u). More generally, there is now a rather complete theory as to when graphs can be isometrically embedded in a cartesian product of smaller graphs (Graham/Winkler).

  69. Define N*(G) to be the least N for which a valid addressing of the directed graph G exists.

Recommend

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest path between two vertices in a graph. We discussed the FloydWarshall algorithm previously, but you may achieve similar results with the Dijkstra

301 views • 26 slides
Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns in data, or grouping similar groups of data-points together into clusters . Clustering algorithms for numeric data: Lloyds K-means, EM

688 views • 19 slides
Finding Finding Al All l Nearest earest Neighb Neighbors ors wi with th a Single a Single

Finding Finding Al All l Nearest earest Neighb Neighbors ors wi with th a Single a Single

Finding Finding Al All l Nearest earest Neighb Neighbors ors wi with th a Single a Single Graph Traversal raph Traversal Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic, and Lars Kulik Motivation Parking undersupply? 65% oversupply [1]

417 views • 22 slides
A Graph Modification Approach for Finding CorePeriphery Structures in Protein Interaction

A Graph Modification Approach for Finding CorePeriphery Structures in Protein Interaction

A Graph Modification Approach for Finding CorePeriphery Structures in Protein Interaction Networks Sharon Bruckner 1 uffner 2 Christian Komusiewicz 2 Falk H 1 Institut f ur Mathematik, Freie Universit at Berlin 2 Institut f ur

397 views • 25 slides
Finding Triangles for Maximum Planar Subgraphs Ghent Graph Theory Workshop 2017 Parinya

Finding Triangles for Maximum Planar Subgraphs Ghent Graph Theory Workshop 2017 Parinya

Finding Triangles for Maximum Planar Subgraphs Ghent Graph Theory Workshop 2017 Parinya Chalermsook a Andreas Schmid b Ghent, August 18, 2017 a Aalto University, Espoo, Finland b Max Planck Institute for Informatics, Saarbrcken, Germany

1.04k views • 70 slides
Path finding Exercise 12-1 Visibility graph: Nodes are corner points of all obstacles, start and

Path finding Exercise 12-1 Visibility graph: Nodes are corner points of all obstacles, start and

Path finding Exercise 12-1 Visibility graph: Nodes are corner points of all obstacles, start and target An edge between a pair of nodes (a,b) exists if and only if a and b can see another, i.e. if the line [a,b] is not interrupted by

763 views • 63 slides
Finding Graph Matchings in Data Streams Andrew McGregor, UPenn The Streaming Model The

Finding Graph Matchings in Data Streams Andrew McGregor, UPenn The Streaming Model The

Finding Graph Matchings in Data Streams Andrew McGregor, UPenn The Streaming Model The Streaming Model Classic Problem: Median Finding [Munro & Paterson] The Streaming Model Classic Problem: Median Finding [Munro & Paterson]

912 views • 88 slides
K*: A heuristic search algorithm for finding the k shortest paths by Husain Aljazzar and Stefan

K*: A heuristic search algorithm for finding the k shortest paths by Husain Aljazzar and Stefan

K*: A heuristic search algorithm for finding the k shortest paths by Husain Aljazzar and Stefan Leue The task Finding K shortest paths Many algorithms state of art by Eppstein (EA) Usually assume entire graph explicitly as input

403 views • 25 slides
Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work

Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work

Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work with Therese Biedl University of Waterloo Tutte Paths Planar graph G Tutte Paths X Planar graph G Tutte Paths X Planar graph G Y Tutte Paths X

1.95k views • 181 slides
Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by

Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by

Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by layer from a start vertex s . s . . . Layer 0 Layer 1 Layer 2 3 / 16 BFS Applications Finding a shortest path. Determine distances.

889 views • 35 slides
Graph Search + DAGs Breadth First Search Breadth First Search (BFS) Idea Explore a graph

Graph Search + DAGs Breadth First Search Breadth First Search (BFS) Idea Explore a graph

Graph Search + DAGs Breadth First Search Breadth First Search (BFS) Idea Explore a graph layer by layer from a start vertex s . s . . . Layer 0 Layer 1 Layer 2 3 / 29 BFS Applications Finding a shortest path. Determine

592 views • 48 slides
STATUS COUNT FINDING APPROVED 5 FINDING CONDITIONAL 16 FINDING DENIED 11

STATUS COUNT FINDING APPROVED 5 FINDING CONDITIONAL 16 FINDING DENIED 11

STATUS COUNT FINDING APPROVED 5 FINDING CONDITIONAL 16 FINDING DENIED 11 LICENSED 148 PENDING 27 WITHDRAWN 32 TOTAL 239 ADUs reviewed as Special Exceptions Pre 2013 ZTA 12-11 Allows ADUs as

741 views • 14 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
Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit:

Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit:

Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit: Joakim Nivre Directed Spanning Trees Dependency Parsing as Finding the Maximum Spanning Tree Views parsing as finding the best directed spanning

981 views • 61 slides
Sample Graph Problems Path problems. Graph Operations And Connectedness problems.

Sample Graph Problems Path problems. Graph Operations And Connectedness problems.

Sample Graph Problems Path problems. Graph Operations And Connectedness problems. Representation Spanning tree problems. Path Finding Another Path Between 1 and 8 Path between 1 and 8. 2 2 4 3 4 3 8 8 8 8 1 1 6 10

95 views • 9 slides
Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed

Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed

Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed Acyclic Graphs (DAG) A directed acyclic graph (or DAG for short) is a directed graph that contains no cycles. Note that the direction of edges is

158 views • 13 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
CS 6280: Fall 2008 Algorithm Design Review Guozhang Wang September 25, 2010 1 Graph Algorithms

CS 6280: Fall 2008 Algorithm Design Review Guozhang Wang September 25, 2010 1 Graph Algorithms

CS 6280: Fall 2008 Algorithm Design Review Guozhang Wang September 25, 2010 1 Graph Algorithms 1.1 Depth-First Search In this section we present DFS and one of its applications: finding Strongly Connected Components of a directed graph. One

325 views • 19 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
NEEDFINDING IN HUMAN CENTERED DESIGN What is need finding? What is need finding? What is need

NEEDFINDING IN HUMAN CENTERED DESIGN What is need finding? What is need finding? What is need

NEEDFINDING IN HUMAN CENTERED DESIGN What is need finding? What is need finding? What is need finding? Needfinding is the process of uncovering User needs Opportunities for improvement Design Insights by learning about their goals

418 views • 14 slides
Finding Dense Subgraphs via Low-Rank Bilinear Optimization Ioannis Mitliagkas Dimitris

Finding Dense Subgraphs via Low-Rank Bilinear Optimization Ioannis Mitliagkas Dimitris

Finding Dense Subgraphs via Low-Rank Bilinear Optimization Ioannis Mitliagkas Dimitris Papailiopoulos with: Alex Dimakis UT Austin Constantine Caramanis Densest k-Subgraph (DkS) Given graph and a parameter k Find k vertices

1.26k views • 66 slides
Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of

Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of

Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of graph parameters Graph Sparsification Graph Sparsifiers Spanners Emulators Small stretch spanning trees Vertex sparsifiers

861 views • 34 slides
GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan*

GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan*

Graph Mining and Graph Kernels GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels 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

1.16k views • 48 slides
1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

CS 224W Graph clustering Austin Benson Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster

317 views • 9 slides

More recommend