Presentation is loading. Please wait.

Presentation is loading. Please wait.

R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 קומבינטוריקה למדעי - המחשב – הרצאה #16 1.4 DE BRUIJN SEQUENCES מבוסס על הספר : S. Even, "Graph Algorithms",

Published by Modified over 8 years ago

Similar presentations

Presentation on theme: "R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 קומבינטוריקה למדעי - המחשב – הרצאה #16 1.4 DE BRUIJN SEQUENCES מבוסס על הספר : S. Even, "Graph Algorithms","— Presentation transcript:

1 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 קומבינטוריקה למדעי - המחשב – הרצאה #16 1.4 DE BRUIJN SEQUENCES מבוסס על הספר : S. Even, "Graph Algorithms", Computer Science Press, 1979 שקפים, ספר וחומר רלוונטי נוסף באתר הקורס : Slides, book and other related material at: http://www.cs.technion.ac.il/~cs234141

2 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 2 1.4 DE BRUIJN SEQUENCES 1.4 DE BRUIJN SEQUENCES Let  = {0, 1,...,  – 1} be an alphabet of  letters. Clearly there are  n different words of length n over . A de Bruijn sequence is a (circular) sequence a 0 a 1... a l-1 over  such that for every word w of length n over  there exists a unique i such that a i a i+1... a i+n-1 = w,

3 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 3 G ,n (V, E) which has the following structure: 1. V is the set of all  n-1 words of length n – 1 over . 2. E is the set of all  n words of length n over . 3. The edge b 1 b 2 … b n, starts at vertex b 1 b 2 … b n-1 and ends at vertex b 2 b 3 … b n.

4 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 4 Fig 1.5 G 2,3

5 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 5 Fig 1.6 G 2,4

6 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 6 Fig 1.7 G 3,2

7 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 7 Theorem 1.3: For every positive integers  and n, G ,n has a directed Euler circuit. Proof: (Strong Connectivity) קשירות היטב we shall show that G ,n is strongly connected. Let b 1 b 2 … b n-1 and c 1 c 2 … c n-1 be any two vertices; the directed path b 1 b 2 … b n- c 1, b 2 b 3 … b n-1 c 1 c 2, …, b n-1 c 1 c 2 … c n-1 leads from the first to the second.

8 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 8 Theorem 1.3: For every positive integers  and n, G ,n has a directed Euler circuit. Proof (Cont…): (degrees) דרגות we have to show that d out (v) = d in (v) for each vertex v. The vertex b 1 b 2 … b n-1 is entered by edges cb 1 b 2 … b n-1, where c can be chosen in  ways, and is the start vertex of edges b 1 b 2 … b n-1 c, where again c can be chosen in  ways.

9 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 9 Theorem 1.3: For every positive integers  and n, G ,n has a directed Euler circuit. Corollary 1.1: For every positive integers  and n there exists a de Bruijn sequence:

10 R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 10 Fig 1.5 G 2,3 001, 011, 111, 110, 101, 010, 100, 000

Download ppt "R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 קומבינטוריקה למדעי - המחשב – הרצאה #16 1.4 DE BRUIJN SEQUENCES מבוסס על הספר : S. Even, "Graph Algorithms","

Similar presentations

CS 336 March 19, 2012 Tandy Warnow.

CS 336 March 19, 2012 Tandy Warnow.
Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,

 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
Chapter 8 Topics in Graph Theory

Chapter 8 Topics in Graph Theory
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.

Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
De Bruijn sequences Rotating drum problem:

De Bruijn sequences Rotating drum problem:
Graph-02.

Graph-02.
 期中测验时间：本周五上午 9 ： 40  教师 TA 答疑时间 : 周三晚上 6 ： 00—8 ： 30  地点：软件楼 315 房间，  教师 TA ：李弋老师  开卷考试.

 期中测验时间：本周五上午 9 ： 40  教师 TA 答疑时间 : 周三晚上 6 ： 00—8 ： 30  地点：软件楼 315 房间，  教师 TA ：李弋老师  开卷考试.
9.7 Planar Graphs. Intro problem- 3 houses and 3 utilities K 3,3 problem: Can 3 houses be connected to 3 utilities so that no 2 lines cross? Similarly,

9.7 Planar Graphs. Intro problem- 3 houses and 3 utilities K 3,3 problem: Can 3 houses be connected to 3 utilities so that no 2 lines cross? Similarly,
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.

Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
De Bruijn Sequences Define an alphabet A consisting of k elements E.g. A={0,1}, A={a,b,c}, A= { 图，论，很，好， 玩 } K=2 ， K=3 ， and K=5 in the preceding example.

De Bruijn Sequences Define an alphabet A consisting of k elements E.g. A={0,1}, A={a,b,c}, A= { 图，论，很，好， 玩 } K=2 ， K=3 ， and K=5 in the preceding example.
R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 Graph theory – תורת הגרפים 4.4 CATALAN NUMBERS מבוסס על הספר : S. Even, Graph Algorithms, Computer.

R. Bar-Yehuda © 1 Graph theory – תורת הגרפים 4.4 CATALAN NUMBERS מבוסס על הספר : S. Even, "Graph Algorithms", Computer.
Section 2.1 Euler Cycles Vocabulary CYCLE – a sequence of consecutively linked edges (x 1,x2),(x2,x3),…,(x n-1,x n ) whose starting vertex is the ending.

Section 2.1 Euler Cycles Vocabulary CYCLE – a sequence of consecutively linked edges (x 1,x2),(x2,x3),…,(x n-1,x n ) whose starting vertex is the ending.
R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 קומבינטוריקה למדעי - המחשב – הרצאה #17 Chapter 2: TREES מבוסס על הספר : S. Even, Graph Algorithms,

R. Bar-Yehuda © 1 קומבינטוריקה למדעי - המחשב – הרצאה #17 Chapter 2: TREES מבוסס על הספר : S. Even, "Graph Algorithms",
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 Graph theory – תורת הגרפים 2.4 Directed Trees – עצים מכוונים מבוסס על הספר : S. Even, Graph Algorithms,

R. Bar-Yehuda © 1 Graph theory – תורת הגרפים 2.4 Directed Trees – עצים מכוונים מבוסס על הספר : S. Even, "Graph Algorithms",
R. Bar-Yehuda © www.cs.technion.ac.il/~cs234141 1 Graph theory – תורת הגרפים 2.6 THE NUMBER OF SPANNING TREE מבוסס על הספר : S. Even, Graph Algorithms,

R. Bar-Yehuda © 1 Graph theory – תורת הגרפים 2.6 THE NUMBER OF SPANNING TREE מבוסס על הספר : S. Even, "Graph Algorithms",
Section 3.1 Properties of Trees Sarah Graham. Tree Talk: Vocabulary oTree: a tree is a special type of graph that contains designated vertex called a.

Section 3.1 Properties of Trees Sarah Graham. Tree Talk: Vocabulary oTree: a tree is a special type of graph that contains designated vertex called a.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

Similar presentations

Ads by Google