On the Parikh-de-Bruijn grid
|
|
|
- Silas Hood
- 5 years ago
- Views:
Transcription
1 On the Parikh-de-Bruijn grid Péter Burcsi Zsuzsanna Lipták W. F. Smyth ELTE Budapest (Hungary), U of Verona (Italy), McMaster U (Canada) & Murdoch U (Australia) Words & Complexity 2018 Lyon, Feb. 2018
2 Alphabet Σ: finite, ordered, constant size σ Given string s, the Parikh vector of s pv(s) is vector of multiplicities of characters Given a Pv p, its order is the sum of its entries = length of a string with Pv p Ex. s = aabaccba over Σ = {a, b, c}, then pv(s) = (4, 2, 2), order 8. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
3 Alphabet Σ: finite, ordered, constant size σ Given string s, the Parikh vector of s pv(s) is vector of multiplicities of characters Given a Pv p, its order is the sum of its entries = length of a string with Pv p Ex. s = aabaccba over Σ = {a, b, c}, then pv(s) = (4, 2, 2), order 8. Two strings over the same alphabet are Parikh equivalent (a.k.a. abelian equivalent) if they have the same Parikh vector (i.e. if they are permutations of one another) Ex. aaaabbcc and aabcaabc are both Parikh equivalent to s. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
4 Alphabet Σ: finite, ordered, constant size σ Given string s, the Parikh vector of s pv(s) is vector of multiplicities of characters Given a Pv p, its order is the sum of its entries = length of a string with Pv p Ex. s = aabaccba over Σ = {a, b, c}, then pv(s) = (4, 2, 2), order 8. Two strings over the same alphabet are Parikh equivalent (a.k.a. abelian equivalent) if they have the same Parikh vector (i.e. if they are permutations of one another) Ex. aaaabbcc and aabcaabc are both Parikh equivalent to s. In Abelian stringology, equality is replaced by Parikh equivalence. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
5 Abelian stringology In Abelian stringology, equality is replaced by Parikh equivalence. Jumbled Pattern Matching abelian borders abelian periods abelian squares, repetitions, runs abelian pattern avoidance abelian reconstruction abelian problems on run-length encoded strings abelian complexity... Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
6 Abelian stringology In this talk, we introduce a new tool for attacking abelian problems. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
7 Abelian stringology In this talk, we introduce a new tool for attacking abelian problems. But first: What s so different about abelian problems? Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
8 An example problem Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
9 Parikh-de-Bruijn strings Recall: A de Bruijn sequence of order k over alphabet Σ is a string over Σ which contains every u Σ k exactly once as a substring. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
10 Parikh-de-Bruijn strings Recall: A de Bruijn sequence of order k over alphabet Σ is a string over Σ which contains every u Σ k exactly once as a substring. Ex. Σ = {a, b}, order 2: aabba, order 3: aaababbbaa Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
11 Parikh-de-Bruijn strings Recall: A de Bruijn sequence of order k over alphabet Σ is a string over Σ which contains every u Σ k exactly once as a substring. Ex. Σ = {a, b}, order 2: aabba, order 3: aaababbbaa We define the abelian analogue: Def. A Parikh-de-Bruijn string of order k (a (k, σ)-pdb-string) is a string s over an alphabet of size σ s.t. p Parikh vector of order k!(i, j) s.t. pv(s i s j ) = p Ex. aabbcca is a ( k 2, σ 3)-PdB-string Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
12 Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
13 Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. correspond to Hamiltonian paths in the de Bruijn graph of order k Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
14 Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. correspond to Hamiltonian paths in the de Bruijn graph of order k and to Euler-paths in the de Bruijn graph of order k 1 Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
15 bab Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. correspond to Hamiltonian paths in the de Bruijn graph of order k and to Euler-paths in the de Bruijn graph of order k 1 aab ab abb aaa aa aba bb bbb baa ba bba Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
16 bab Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. correspond to Hamiltonian paths in the de Bruijn graph of order k and to Euler-paths in the de Bruijn graph of order k 1 aab ab abb aaa aa aba bb bbb baa ba bba order 2: aabba Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
17 bab Parikh-de-Bruijn strings Classical case: De Bruijn sequences exist for every Σ and k. correspond to Hamiltonian paths in the de Bruijn graph of order k and to Euler-paths in the de Bruijn graph of order k 1 aab ab abb aaa aa aba bb bbb baa ba bba order 2: aabba order 3: aaababbbaa Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
18 Parikh-de-Bruijn strings Abelian case: aabbcca is a ( k 2, σ 3)-PdB-string Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
19 Parikh-de-Bruijn strings Abelian case: aabbcca is a ( k 2, σ 3)-PdB-string abbbcccaaabc is a (3, 3)-PdB-string Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
20 Parikh-de-Bruijn strings Abelian case: aabbcca is a ( 2, k 3)-PdB-string σ abbbcccaaabc is a (3, 3)-PdB-string but no (4, 3)-PdB-string exists Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
21 Parikh-de-Bruijn strings Abelian case: aabbcca is a ( 2, k 3)-PdB-string σ abbbcccaaabc is a (3, 3)-PdB-string but no (4, 3)-PdB-string exists and no (2, 4)-PdB-string exists Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
22 The Parikh-de-Bruijn grid Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
23 bab Recall: de Bruijn graph db k = (V, E), where V = Σ k and (xu, uy) E for all x, y Σ and u Σ k 1 N.B. edges ˆ= (k + 1)-length strings aab ab abb aaa aa aba bb bbb edges ˆ= one-character shifts baa ba bba Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
24 bab Recall: de Bruijn graph db k = (V, E), where V = Σ k and (xu, uy) E for all x, y Σ and u Σ k 1 N.B. edges ˆ= (k + 1)-length strings aab ab abb aaa aa aba bb bbb edges ˆ= one-character shifts baa ba bba A straightforward generalization to Pv s gives: Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
25 bab Recall: de Bruijn graph db k = (V, E), where V = Σ k and (xu, uy) E for all x, y Σ and u Σ k 1 N.B. edges ˆ= (k + 1)-length strings aab ab abb aaa aa aba bb bbb edges ˆ= one-character shifts baa ba bba A straightforward generalization to Pv s gives: edges ˆ= one-character shifts, Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
26 bab Recall: de Bruijn graph db k = (V, E), where V = Σ k and (xu, uy) E for all x, y Σ and u Σ k 1 N.B. edges ˆ= (k + 1)-length strings aab ab abb aaa aa aba bb bbb edges ˆ= one-character shifts baa ba bba A straightforward generalization to Pv s gives: edges ˆ= one-character shifts, undirected edges Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
27 bab Recall: de Bruijn graph db k = (V, E), where V = Σ k and (xu, uy) E for all x, y Σ and u Σ k 1 N.B. edges ˆ= (k + 1)-length strings aab ab abb aaa aa aba bb bbb edges ˆ= one-character shifts baa ba bba A straightforward generalization to Pv s gives: NO: edges ˆ= (k + 1)-order Pv s! edges ˆ= one-character shifts, undirected edges Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
28 Let s look at another example: Here, σ = 3, k = ca ab bc aa bb cc ba cb ac In the abelian version, several edges have the same label (i.e. here: 3-order Pv). Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
29 Turns out the right way to generalize de Bruijn graphs is the Parikh-de-Bruijn grid: Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
30 For σ = 4, k = 5, the Parikh-de-Bruijn grid looks like this: Zs. Lipta k, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
31 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
32 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s pq E iff exist x, y Σ s.t. p = q x + y (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
33 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s pq E iff exist x, y Σ s.t. p = q x + y undirected edges (or: bidirectional edges) (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
34 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s pq E iff exist x, y Σ s.t. p = q x + y undirected edges (or: bidirectional edges) loops at every node, different one for each non-zero character (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
35 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s pq E iff exist x, y Σ s.t. p = q x + y undirected edges (or: bidirectional edges) loops at every node, different one for each non-zero character (k + 1)- and (k 1)-order Pv s ˆ= (σ 1)-simplices (triangles for σ = 3, tetrahedra for σ = 4 etc.) (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
36 The Parikh-de-Bruijn grid PdB-grid: V = k-order Pv s pq E iff exist x, y Σ s.t. p = q x + y undirected edges (or: bidirectional edges) loops at every node, different one for each non-zero character (k + 1)- and (k 1)-order Pv s ˆ= (σ 1)-simplices (triangles for σ = 3, tetrahedra for σ = 4 etc.) (4, 3)-grid; loops not included in figure Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
37 The Parikh-de-Bruijn grid The (4, 3)-PdB-grid The (4, 4)-PdB-grid vertices: k-order Pv s (vertices), downward triangles/tetrahedra: (k + 1)-order Pv s, (upward triangles/tetrahedra: (k 1)-order Pv s. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
38 point(l3, color = 'orange', size=9) The Parikh-de-Bruijn grid The diagonal section of the integer grid with the hyperplanes H k (green), H k+1 (blue), and H k 1 (yellow), for k = 6 and σ = 3. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
39 Back to the example problem Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
40 More differences Classical case: (db k ) One-to-one correspondence: walks and strings. Abelian case: Every string corresponds to a walk in the PdB-grid, but not every walk corresponds to a string. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
41 More differences Classical case: (db k ) One-to-one correspondence: walks and strings. Abelian case: Every string corresponds to a walk in the PdB-grid, but not every walk corresponds to a string. Classical case: De Bruijn sequences exist for every k and σ. Abelian case: PdB-strings do not exist for every k and σ. (N.B. Not all PdB-strings come from circular strings = universal cycles!) Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
42 Back to Parikh-de-Bruijn strings Theorem 1 No (k, 3)-PdB strings exist for k 4. Theorem 2 A (2, σ)-pdb string exists if and only if σ is odd. Theorem 3 A (3, σ)-pdb string exists if and only if σ = 3 or σ not a multiple of 3. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
43 Theorem 1 No (k, 3)-PdB strings exist for k 4. Lemma 1 If the walk induced by string w does not use any loops, then for all i: w i w i+k. Proof Otherwise we would have two consecutive occurrences of the same Pv p, thus using a loop at p. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
44 Theorem 1: No (k, 3)-PdB strings exists for k 4. (Proof uses Lemma 1.) p x = (k, 0, 0) p y k = (, 0, ) p y+k = (, 0, ) p y = (0, k, 0) p z = (0, 0, k) p x+k = (0,, ) w = aaa }{{ a} bbb }{{ b} ccc }{{ c} k k k position x position y position z Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
45 Example 2: Covering strings Classical case: If s is a (classical) de Bruijn sequence of order k, then it also contains all (k 1)-length strings as substrings. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
46 Example 2: Covering strings Classical case: If s is a (classical) de Bruijn sequence of order k, then it also contains all (k 1)-length strings as substrings. Abelian case: not always true, e.g. aaaaabbbbbcaaaadbbbcccccdddddaaaccdbcbaccaccddbddbadacddbbbb is a (5, 4)-PdB-string but is not (4, 4)-covering: no substring with Pv (1, 1, 1, 1). Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
47 Example 2: Covering strings Classical case: If s is a (classical) de Bruijn sequence of order k, then it also contains all (k 1)-length strings as substrings. Abelian case: not always true, e.g. aaaaabbbbbcaaaadbbbcccccdddddaaaccdbcbaccaccddbddbadacddbbbb is a (5, 4)-PdB-string but is not (4, 4)-covering: no substring with Pv (1, 1, 1, 1). Theorem 4 For every σ 3 and k 4, there exist (k, σ)-covering strings which are not (k 1, σ)-covering. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
48 Experimental results k σ string length (excess) 2 3 aabbcca 7 (0) 3 3 abbbcccaaabc 12 (0) 4 3 aaaabbbbccccaacabcb 19 (1) 5 3 aaaaabbbacccccbbbbbaacaaccb 27 (2) 6 3 aaaabccccccaaaaaabbbbbbcccbbcabbaca 35 (2) 7 3 aabbbccbbcccabacaaabcbbbbbbbaaaaaaacccccccba 44 (2) 2 4 aabbcadbccdd 12 (1) 3 4 aaabbbcaadbdbccadddccc 22 (0) 4 4 aabbbbcaacadbddbccacddddaaaabdbbccccdd 38 (0) 5 4 aaaaabbbbbcaaaadbbbcccccdddddaaaccdbcbaccaccddbddbadacddbbbb 60 (0) 2 5 aabbcadbeccddeea 16 (0) 3 5 aaabbbcaadbbeaccbdddcccebededadceeeaa 37 (0) 4 5 aaaabbbbcaaadbbbeaaccbbddaaeaebcccadbeeeadddcccceeeedddd (0) Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
49 Conclusion and open problems new tool for modeling and solving abelian problems find good characterization for walks which correspond to strings many open problems on PdB- and covering strings, e.g. For which σ and k do PdB-strings exist? (We answered this question only for some special cases.) What is the length of a shortest covering string when no PdB-string exists, e.g. k = 3, σ = 6? What is the minimum proportion of (k 1)-order Pv s covered by a k-covering string? apply PdB-grid to other abelian problems paper on Arxiv Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
50 Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
51 Appendix Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
52 example (marked in blue, resp. brown). If the edge connects a vertex p with itself, then the induced (k + 1)- and (k 1)-order Pv s are given by triangles at the opposite direction with respect to p. This is the case in our example in the second (red) and third The (green) Parikh-de-Bruijn steps. grid k = 4, σ = a c b b c 221 a (k +1) a b c aabacabb k a b c (k 1) a b c Walk corresponding to aabacabb. (k + 1)- and (k 1)-order Pv s: triangles Fig. 3. Left: The part of the (4, 3)-PdB-grid being visited by the string aabacabb. We marked incidenteach to the stepedges of thetraversed walk in aby di erent the walk. colour The (blue-red-green-brown). (k + 1) and (k 1)-order Right: Pv s We list for loops vertically (same thek-order corresponding Pv twice) (k + lie1)-order in opposite Pv s (top), direction, k-order hence Pv s the (center), name bow. and (k 1)-order Pv s, each at its beginning position. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
53 Parikh-de-Bruijn and covering strings Theorem 2 A (2, σ)-pdb string exists if and only if σ is odd. Proof Pv s of order 2 either form (0...0, i 2, 0..0) or (0...0, i 1, 0...0, j 1, 0..0). So we need exactly one substring aa for all a Σ, and either ab or ba for all a, b Σ. Consider the undirected complete graph G = (V, E) with loops where V = Σ (N.B.: not the PdB-grid!): an Euler path exists iff σ is odd a b e c Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32 d
54 Next best thing: covering strings. Def. Ex. Example 2: Covering strings We call a string s (k, σ)-covering if p Parikh vector of order k (i, j) s.t. pv(s i s j ) = p (There is at least one substring in s which has Pv p.) The excess of s is: s ( ) σ+k 1 k + k 1. }{{} length of a PdB-string aaaabbbbccccaacabcb is a shortest (4, 3)-covering string, with excess 1. aabbcadbccdd is a shortest (2, 4)-covering string, with excess 1. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
55 Example 2: Covering strings Classical case: If s is a (classical) de Bruijn sequence of order k, then it also contains all (k 1)-length strings as substrings. For PdB-strings, this is not always true, e.g. aaaaabbbbbcaaaadbbbcccccdddddaaaccdbcbaccaccddbddbadacddbbbb is a (5, 4)-PdB-string but is not (4, 4)-covering: no substring with Pv (1, 1, 1, 1). Theorem 4 For every σ 3 and k 4, there exist (k, σ)-covering strings which are not (k 1, σ)-covering. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
56 The Parikh-de-Bruijn grid Lemma 2 A set of k-order Parikh vectors is realizable if and only if the induced subgraph in the k-pdb-grid is connected. realizable = exists string with exactly these k-order sub-pv s. Proof sketch : clear. : Use loops until undesired character x exits, replace by new character y. Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
57 Parikh-de-Bruijn and covering strings Theorem 4 For every σ 3 and k 4, there exist (k, σ)-covering strings which are not (k 1, σ)-covering. Proof w = aaaaabbbbbcabbaaacacbbcbccacaccccbccccc General construction: remove (k 1)-order Pv p = (k 3, 1, 1, 0,..., 0) with incident edges and vertices the rest is connected, hence a string exists (Lemma 2) add vertices of p without traversing edges incident to p can be done by detours from corners of PdB-grid Zs. Lipták, P. Burcsi, W.F. Smyth On the Parikh-de-Bruijn grid Words & Complexity / 32
Data Compression Fundamentals
1 Data Compression Fundamentals Touradj Ebrahimi Touradj.Ebrahimi@epfl.ch 2 Several classifications of compression methods are possible Based on data type :» Generic data compression» Audio compression»
CHAPTER TWO LANGUAGES. Dr Zalmiyah Zakaria
CHAPTER TWO LANGUAGES By Dr Zalmiyah Zakaria Languages Contents: 1. Strings and Languages 2. Finite Specification of Languages 3. Regular Sets and Expressions Sept2011 Theory of Computer Science 2 Strings
Prefix normal words, binary jumbled pattern matching, and bubble languages
Prefix normal words, binary jumbled pattern matching, and bubble languages Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, and Joe Sawada LSD/LAW 2014 London, 6-7 Feb. 2014 How marrying two
Section 1.7 Sequences, Summations Cardinality of Infinite Sets
Section 1.7 Sequences, Summations Cardinality of Infinite Sets Definition: A sequence is a function from a subset of the natural numbers (usually of the form {0, 1, 2,... } to a set S. Note: the sets and
Paths, Circuits, and Connected Graphs
Paths, Circuits, and Connected Graphs Paths and Circuits Definition: Let G = (V, E) be an undirected graph, vertices u, v V A path of length n from u to v is a sequence of edges e i = {u i 1, u i} E for
Section 2.4 Sequences and Summations
Section 2.4 Sequences and Summations Definition: A sequence is a function from a subset of the natural numbers (usually of the form {0, 1, 2,... } to a set S. Note: the sets and {0, 1, 2, 3,..., k} {1,
Compiler Construction
Compiler Construction Exercises 1 Review of some Topics in Formal Languages 1. (a) Prove that two words x, y commute (i.e., satisfy xy = yx) if and only if there exists a word w such that x = w m, y =
Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4
1. Draw Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 (i) a simple graph. A simple graph has a non-empty vertex set and no duplicated edges. For example sketch G with V
MAT 145: PROBLEM SET 4
MAT 145: PROBLEM SET 4 DUE TO FRIDAY FEB 22 Abstract. This problem set corresponds to the sixth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Feb 15 and is
Chapter 2: Graph Theory
Chapter 2: Graph Theory Graph Theory Introduction Applications of Graphs: Convenient representation/visualisation to many Mathematical, Engineering and Science Problems. Fundamental Data Structure in Computer
Chapter 4: Regular Expressions
CSI 3104 /Winter 2011: Introduction to Formal Languages What are the languages with a finite representation? We start with a simple and interesting class of such languages. Dr. Nejib Zaguia CSI3104-W11
Lecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
QUESTION BANK. Unit 1. Introduction to Finite Automata
QUESTION BANK Unit 1 Introduction to Finite Automata 1. Obtain DFAs to accept strings of a s and b s having exactly one a.(5m )(Jun-Jul 10) 2. Obtain a DFA to accept strings of a s and b s having even
Regular Expressions. Lecture 10 Sections Robb T. Koether. Hampden-Sydney College. Wed, Sep 14, 2016
Regular Expressions Lecture 10 Sections 3.1-3.2 Robb T. Koether Hampden-Sydney College Wed, Sep 14, 2016 Robb T. Koether (Hampden-Sydney College) Regular Expressions Wed, Sep 14, 2016 1 / 23 Outline 1
Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
Automata Theory TEST 1 Answers Max points: 156 Grade basis: 150 Median grade: 81%
Automata Theory TEST 1 Answers Max points: 156 Grade basis: 150 Median grade: 81% 1. (2 pts) See text. You can t be sloppy defining terms like this. You must show a bijection between the natural numbers
Glynda, the good witch of the North
Strings and Languages It is always best to start at the beginning -- Glynda, the good witch of the North What is a Language? A language is a set of strings made of of symbols from a given alphabet. An
Chapter 18: Decidability
Chapter 18: Decidability Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu Please read the corresponding chapter before
Lec-5-HW-1, TM basics
Lec-5-HW-1, TM basics (Problem 0)-------------------- Design a Turing Machine (TM), T_sub, that does unary decrement by one. Assume a legal, initial tape consists of a contiguous set of cells, each containing
Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a
Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite
Algorithms on Words Introduction CHAPTER 1
CHAPTER 1 Algorithms on Words 1.0. Introduction This chapter is an introductory chapter to the book. It gives general notions, notation, and technical background. It covers, in a tutorial style, the main
On Combinatorial Generation of Prefix Normal Words
On Combinatorial Generation of Prefix Normal Words Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, and Joe Sawada CPM 2014 Moscow, 16-18 June 2014 How marrying two topics can lead to an explosion
XVIII Open Cup named after E.V. Pankratiev Stage 10, Grand Prix of Korea, Sunday, February 4, 2018
Problem A. Donut file: XVIII Open Cup named after E.V. Pankratiev 3 seconds 1024 mebibytes In this problem, we will use Chebyshev distance on a Cartesian plane. The Chebyshev distance between two points
Counting Faces of Polytopes
Counting Faces of Polytopes Carl Lee University of Kentucky James Madison University March 2015 Carl Lee (UK) Counting Faces of Polytopes James Madison University 1 / 36 Convex Polytopes A convex polytope
Models and Algorithms for Complex Networks
Models and Algorithms for Complex Networks with network with parametrization, elements maintaining typically characteristic local profiles with categorical attributes [C. Faloutsos MMDS8] Milena Mihail
Bayesian Networks and Decision Graphs
ayesian Networks and ecision raphs hapter 7 hapter 7 p. 1/27 Learning the structure of a ayesian network We have: complete database of cases over a set of variables. We want: ayesian network structure
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
Graph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
Proof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory
Proof Techniques Alphabets, Strings, and Languages Foundations of Computer Science Theory Proof By Case Enumeration Sometimes the most straightforward way to prove that a property holds for all elements
V :non-empty vertex ornode set E V V :edge set G (V, E) :directed graph on V, or digraph on V
-93-11. Graph Theory Example: V :non-empty vertex ornode set E V V :edge set G (V, E) :directed graph on V, or digraph on V b e f V={a, b, c, d, e, f, g} a c d f E={(a,b), (b,c), (c,a),... } Note: (a,
Graphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
Assignment No.4 solution. Pumping Lemma Version I and II. Where m = n! (n-factorial) and n = 1, 2, 3
Assignment No.4 solution Question No.1 a. Suppose we have a language defined below, Pumping Lemma Version I and II a n b m Where m = n! (n-factorial) and n = 1, 2, 3 Some strings belonging to this language
JNTUWORLD. Code No: R
Code No: R09220504 R09 SET-1 B.Tech II Year - II Semester Examinations, April-May, 2012 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max. Marks: 75 Answer any five
CS402 Theory of Automata Solved Subjective From Midterm Papers. MIDTERM SPRING 2012 CS402 Theory of Automata
Solved Subjective From Midterm Papers Dec 07,2012 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 MIDTERM SPRING 2012 Q. Point of Kleen Theory. Answer:- (Page 25) 1. If a language can be accepted
Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
Notes for Comp 454 Week 2
Notes for Comp 454 Week 2 This week we look at the material in chapters 3 and 4. Homework on Chapters 2, 3 and 4 is assigned (see end of notes). Answers to the homework problems are due by September 10th.
Combinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
Majority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
DEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
Characterization of Graphs with Eulerian Circuits
Eulerian Circuits 3. 73 Characterization of Graphs with Eulerian Circuits There is a simple way to determine if a graph has an Eulerian circuit. Theorems 3.. and 3..2: Let G be a pseudograph that is connected
Math 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
ITEC2620 Introduction to Data Structures
ITEC2620 Introduction to Data Structures Lecture 9b Grammars I Overview How can a computer do Natural Language Processing? Grammar checking? Artificial Intelligence Represent knowledge so that brute force
Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
If three points A (h, 0), P (a, b) and B (0, k) lie on a line, show that: a b 1.
ASSIGNMENT ON STRAIGHT LINES LEVEL 1 (CBSE/NCERT/STATE BOARDS) 1 Find the angle between the lines joining the points (0, 0), (2, 3) and the points (2, 2), (3, 5). 2 What is the value of y so that the line
CONSTRUCTIONS Introduction Division of a Line Segment
216 MATHEMATICS CONSTRUCTIONS 11 111 Introduction In Class IX, you have done certain constructions using a straight edge (ruler) and a compass, eg, bisecting an angle, drawing the perpendicular bisector
More NP-complete Problems. CS255 Chris Pollett May 3, 2006.
More NP-complete Problems CS255 Chris Pollett May 3, 2006. Outline More NP-Complete Problems Hamiltonian Cycle Recall a hamiltonian cycle is a permutation of the vertices v i_1,, v i_n of a graph G so
Skyup's Media. PART-B 2) Construct a Mealy machine which is equivalent to the Moore machine given in table.
Code No: XXXXX JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD B.Tech II Year I Semester Examinations (Common to CSE and IT) Note: This question paper contains two parts A and B. Part A is compulsory
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or elements of the set. a) Use capital letters to stand for sets
Exercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
Interleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
Eulerian Tours and Fleury s Algorithm
Eulerian Tours and Fleury s Algorithm CSE21 Winter 2017, Day 12 (B00), Day 8 (A00) February 8, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Vocabulary Path (or walk): describes a route from one vertex
Assignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
Polygon Triangulation
Polygon Triangulation Definition Simple Polygons 1. A polygon is the region of a plane bounded by a finite collection of line segments forming a simple closed curve. 2. Simple closed curve means a certain
On vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
Topic 10 Part 2 [474 marks]
![Topic 10 Part 2 [474 marks]](/thumbs/89/97991710.jpg "Topic 10 Part 2 [474 marks]")
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
Some Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
1. Which of the following regular expressions over {0, 1} denotes the set of all strings not containing 100 as a sub-string?
Multiple choice type questions. Which of the following regular expressions over {, } denotes the set of all strings not containing as a sub-string? 2. DFA has a) *(*)* b) ** c) ** d) *(+)* a) single final
THE LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015
THE LABELLED PEER CODE FOR KNOT AND LINK DIAGRAMS 26th February, 2015 A labelled peer code is a descriptive syntax for a diagram of a knot or link on a two dimensional sphere. The syntax is able to describe
Computer Science 280 Fall 2002 Homework 10 Solutions
Computer Science 280 Fall 2002 Homework 10 Solutions Part A 1. How many nonisomorphic subgraphs does W 4 have? W 4 is the wheel graph obtained by adding a central vertex and 4 additional "spoke" edges
Characterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
Structured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
Math 443/543 Graph Theory Notes 2: Transportation problems
Math 443/543 Graph Theory Notes 2: Transportation problems David Glickenstein September 15, 2014 1 Readings This is based on Chartrand Chapter 3 and Bondy-Murty 18.1, 18.3 (part on Closure of a Graph).
Theorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
Graph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
Power Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
Graph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
Automata Theory CS S-FR Final Review
Automata Theory CS411-2015S-FR Final Review David Galles Department of Computer Science University of San Francisco FR-0: Sets & Functions Sets Membership: a?{a,b,c} a?{b,c} a?{b,{a,b,c},d} {a,b,c}?{b,{a,b,c},d}
Institute of Operating Systems and Computer Networks Algorithms Group. Network Algorithms. Tutorial 4: Matching and other stuff
Institute of Operating Systems and Computer Networks Algorithms Group Network Algorithms Tutorial 4: Matching and other stuff Christian Rieck Matching 2 Matching A matching M in a graph is a set of pairwise
An Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
Chapter 1. Essentials of Geometry
Chapter 1 Essentials of Geometry 1.1 Identify Points, Lines, and Planes Objective: Name and sketch geometric figures so you can use geometry terms in the real world. Essential Question: How do you name
6.2 Initial Problem. Section 6.2 Network Problems. 6.2 Initial Problem, cont d. Weighted Graphs. Weighted Graphs, cont d. Weighted Graphs, cont d
Section 6.2 Network Problems Goals Study weighted graphs Study spanning trees Study minimal spanning trees Use Kruskal s algorithm 6.2 Initial Problem Walkways need to be built between the buildings on
Math.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?
1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this
Conway s Tiling Groups
Conway s Tiling Groups Elissa Ross Department of Mathematics University of British Columbia, BC, Canada elissa@math.ubc.ca December 12, 2004 Abstract In this paper I discuss a method of John Conway for
Graph Theory. Chapter 4.
Graph Theory. Chapter 4. Wandering. Here is an algorithm, due to Tarry, that constructs a walk in a connected graph, starting at any vertex v 0, traversing each edge exactly once in each direction, and
Fundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
Lecture 8: The Traveling Salesman Problem
Lecture 8: The Traveling Salesman Problem Let G = (V, E) be an undirected graph. A Hamiltonian cycle of G is a cycle that visits every vertex v V exactly once. Instead of Hamiltonian cycle, we sometimes
Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
Eulerian tours. Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck. April 20, 2016
Eulerian tours Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 20, 2016 Seven Bridges of Konigsberg Is there a path that crosses each
Chapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
Zhibin Huang 07. Juni Zufällige Graphen
Zhibin Huang 07. Juni 2010 Seite 2 Contents The Basic Method The Probabilistic Method The Ramsey Number R( k, l) Linearity of Expectation Basics Splitting Graphs The Probabilistic Lens: High Girth and
Geometry Review for Test 3 January 13, 2016
Homework #7 Due Thursday, 14 January Ch 7 Review, pp. 292 295 #1 53 Test #3 Thurs, 14 Jan Emphasis on Ch 7 except Midsegment Theorem, plus review Betweenness of Rays Theorem Whole is Greater than Part
The Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
A Theorem of Ramsey- Ramsey s Number
A Theorem of Ramsey- Ramsey s Number A simple instance Of 6 (or more) people, either there are 3 each pair of whom are acquainted or there are 3 each pair of whom are unacquainted Can we explain this without
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs Pinar Heggernes Daniel Meister Andrzej Proskurowski Abstract The problem of computing minimum distortion
RAMSEY NUMBERS IN SIERPINSKI TRIANGLE. Vels University, Pallavaram Chennai , Tamil Nadu, INDIA
International Journal of Pure and Applied Mathematics Volume 6 No. 4 207, 967-975 ISSN: 3-8080 (printed version); ISSN: 34-3395 (on-line version) url: http://www.ijpam.eu doi: 0.2732/ijpam.v6i4.3 PAijpam.eu
14 More Graphs: Euler Tours and Hamilton Cycles
14 More Graphs: Euler Tours and Hamilton Cycles 14.1 Degrees The degree of a vertex is the number of edges coming out of it. The following is sometimes called the First Theorem of Graph Theory : Lemma
UNIT I PART A PART B
OXFORD ENGINEERING COLLEGE (NAAC ACCREDITED WITH B GRADE) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS YEAR/SEM: III/V STAFF NAME: Dr. Sangeetha Senthilkumar SUB.CODE: CS6503 SUB.NAME:
Approximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
2 Solution of Homework
Math 3181 Name: Dr. Franz Rothe February 6, 2014 All3181\3181_spr14h2.tex Homework has to be turned in this handout. The homework can be done in groups up to three due February 11/12 2 Solution of Homework
Graph Algorithms. Tours in Graphs. Graph Algorithms
Graph Algorithms Tours in Graphs Graph Algorithms Special Paths and Cycles in Graphs Euler Path: A path that traverses all the edges of the graph exactly once. Euler Cycle: A cycle that traverses all the
The University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008
The University of Sydney MATH99/09 Graph Theory Tutorial (Week 9) 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find
Math 55 - Spring Lecture notes # 14 - March 9 (Tuesday)
Math 55 - Spring 2004 - Lecture notes # 14 - March 9 (Tuesday) Read Chapter 4 Goals for Today: Continue counting principles Tree diagrams Pigeonhole principle Permutations Combinations Homework: 1) (Based
Genus Ranges of 4-Regular Rigid Vertex Graphs
Genus Ranges of 4-Regular Rigid Vertex Graphs Dorothy Buck Department of Mathematics Imperial College London London, England, UK d.buck@imperial.ac.uk Nataša Jonoska Egor Dolzhenko Molecular and Computational
TWO-PLAYER ENVY-FREE MULTI-CAKE DIVISION
TWO-PLAYER ENVY-FREE MULTI-CAKE DIVISION JOHN CLOUTIER DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA AT SANTA BARBARA SANTA BARBARA CA 906 KATHRYN L. NYMAN DEPARTMENT OF MATHEMATICS AND STATISTICS
Partha Sarathi Mandal
MA 515: Introduction to Algorithms & MA353 : Design and Analysis of Algorithms [3-0-0-6] Lecture 39 http://www.iitg.ernet.in/psm/indexing_ma353/y09/index.html Partha Sarathi Mandal psm@iitg.ernet.in Dept.