Graphical degree sequences and realizations
|
|
- Garey Rogers
- 8 years ago
- Views:
Transcription
1 swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012
2 swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Joint work with Zoltán Király and István Miklós MAPCON 12 MPIPKS - Dresden, May 15, 2012
3 swap 1 2 swap- 3 4
4 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ).
5 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ). If simple graph G(V, E) with d(g) = d
6 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ). If simple graph G(V, E) with d(g) = d d is a graphical sequence G realizes d.
7 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ). If simple graph G(V, E) with d(g) = d d is a graphical sequence G realizes d. Question: how to decide whether d is graphical?
8 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ). If simple graph G(V, E) with d(g) = d d is a graphical sequence G realizes d. Question: how to decide whether d is graphical? - Tutte s f -factor theorem (1952) - applied for K n
9 Degree swap G(V; E) simple graph; V = {v 1, v 2,...,v n } nodes positive integers d = (d 1, d 2,..., d n ). If simple graph G(V, E) with d(g) = d d is a graphical sequence G realizes d. Question: how to decide whether d is graphical? - Tutte s f -factor theorem (1952) - applied for K n polynomial algorithm to decide
10 Degree 2a For complete graphs there are much simpler solutions: swap
11 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955),
12 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization
13 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i )
14 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps
15 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps blacks G, reds (or blues) are missing
16 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps blacks G, reds (or blues) are missing blacks are missing reds G
17 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps blacks G, reds (or blues) are missing blacks are missing reds G The new realization satisfies the same sequence
18 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps Let the lexicographic order on [n] [n]
19 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps Let the lexicographic order on [n] [n] Then implies lexicographic order on V s.t. [n] = s, [n] = subscripts
20 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps Let the lexicographic order on [n] [n] Then implies lexicographic order on V s.t. [n] = s, [n] = subscripts - N G (v) denotes the neighbors of v in realization G then Theorem (Havel s Lemma, 1955) If H V \{v} and H = N G (v) and N G (v) H then there exists realization G such that N G (v) = H.
21 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps Let the lexicographic order on [n] [n] Then implies lexicographic order on V s.t. [n] = s, [n] = subscripts - N G (v) denotes the neighbors of v in realization G then Theorem (Havel s Lemma, 1955) If H V \{v} and H = N G (v) and N G (v) H then there exists realization G such that N G (v) = H.
22 Degree 2a swap For complete graphs there are much simpler solutions: - Havel A remark on the existence of finite graphs. (Czech), Časopis Pěst. Mat. 80 (1955), Greedy algorithm to find a realization time complexity O( d i ) based on swaps Let the lexicographic order on [n] [n] Then implies lexicographic order on V s.t. [n] = s, [n] = subscripts - N G (v) denotes the neighbors of v in realization G then Theorem (Havel s Lemma, 1955) If H V \{v} and H = N G (v) and N G (v) H then there exists realization G such that N G (v) = H. there exists canonical realization
23 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), )
24 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm
25 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm J. K. Senior: Partitions and their Representative Graphs, Amer. J. Math., 73 (1951),
26 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm J. K. Senior: Partitions and their Representative Graphs, Amer. J. Math., 73 (1951), all possible graphs with multiple edges but no loops to find all possible molecules with given composition
27 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm J. K. Senior: Partitions and their Representative Graphs, Amer. J. Math., 73 (1951), all possible graphs with multiple edges but no loops to find all possible molecules with given composition introduced swaps (but called transfusion)
28 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm J. K. Senior: Partitions and their Representative Graphs, Amer. J. Math., 73 (1951), all possible graphs with multiple edges but no loops to find all possible molecules with given composition introduced swaps (but called transfusion) another method: Erdős-Gallai theorem (Graphs with prescribed of vertices (in Hungarian), Mat. Lapok 11 (1960), )
29 Degree 2b swap Hakimi rediscovered (On the realizability of a set of integers as s of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), ) from that time on it is called Havel-Hakimi algorithm J. K. Senior: Partitions and their Representative Graphs, Amer. J. Math., 73 (1951), all possible graphs with multiple edges but no loops to find all possible molecules with given composition introduced swaps (but called transfusion) another method: Erdős-Gallai theorem (Graphs with prescribed of vertices (in Hungarian), Mat. Lapok 11 (1960), ) used Havel s theorem in the proof
30 Transforming one realization into an other one Let d graphical sequence, G and G two realizations swap
31 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1
32 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1 Lemma swap H i H i+1 then swap H i+1 H i
33 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1 Lemma swap H i H i+1 then swap H i+1 H i by Havel-Hakimi s lemma such swap-sequence always exists
34 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1 Lemma swap H i H i+1 then swap H i+1 H i by Havel-Hakimi s lemma such swap-sequence always exists ( ) for i = 1, 2 G i canonical realizations
35 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1 Lemma swap H i H i+1 then swap H i+1 H i by Havel-Hakimi s lemma such swap-sequence always exists ( ) for i = 1, 2 G i canonical realizations swap-distance O( d i )
36 Transforming one realization into an other one swap Let d graphical sequence, G and G two realizations looking for a sequence of realizations G 1 = H 0, H 1,..., H k = G 2 s.t. i = 0,...,k 1 swap operation H i H i+1 Lemma swap H i H i+1 then swap H i+1 H i Theorem (Petersen, see Erdős-Gallai paper) by Havel-Hakimi s lemma such swap-sequence always exists ( ) for i = 1, 2 G i canonical realizations swap-distance O( d i )
37 and directed cases swap Erdős-Gallai type result for bipartite graphs
38 and directed cases swap Erdős-Gallai type result for bipartite graphs D. Gale A theorem on flows in networks, Pacific J. Math. 7 (2) (1957), H.J. Ryser Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957),
39 and directed cases swap Erdős-Gallai type result for bipartite graphs D. Gale A theorem on flows in networks, Pacific J. Math. 7 (2) (1957), flow theory H.J. Ryser Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), binary matrices
40 and directed cases swap Erdős-Gallai type result for bipartite graphs D. Gale A theorem on flows in networks, Pacific J. Math. 7 (2) (1957), flow theory H.J. Ryser Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), binary matrices for both it was byproduct to prove EG-type results for directed graphs: no multiply edges, but possible loops
41 and directed cases swap Erdős-Gallai type result for bipartite graphs D. Gale A theorem on flows in networks, Pacific J. Math. 7 (2) (1957), flow theory H.J. Ryser Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), binary matrices for both it was byproduct to prove EG-type results for directed graphs: no multiply edges, but possible loops Both used bipartite graph representation of directed graphs
42 and directed cases swap Erdős-Gallai type result for bipartite graphs D. Gale A theorem on flows in networks, Pacific J. Math. 7 (2) (1957), flow theory H.J. Ryser Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), binary matrices for both it was byproduct to prove EG-type results for directed graphs: no multiply edges, but possible loops Both used bipartite graph representation of directed graphs Ryser used swap-sequence transformation from one realization to an other one
43 swap 1 2 swap- 3 4
44 Red/blue graphs G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). swap
45 Red/blue graphs swap G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). trail - no multiple edges circuit - closed trail
46 Red/blue graphs swap G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). trail - no multiple edges circuit - closed trail Lemma balanced E(G) decomposed to alternating circuits
47 Red/blue graphs swap G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). trail - no multiple edges circuit - closed trail Lemma balanced E(G) decomposed to alternating circuits Lemma C = v 1, v 2,...v 2n alternating; v i = v j with j i is even. C can be decomposed into two, shorter alternating circuits.
48 Red/blue graphs swap G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). trail - no multiple edges circuit - closed trail Lemma balanced E(G) decomposed to alternating circuits Lemma C = v 1, v 2,...v 2n alternating; v i = v j with j i is even. C can be decomposed into two, shorter alternating circuits. v v
49 Red/blue graphs swap G simple graph with red/blue edges - r(v) / b(v) s G is balanced : v V(G) r(v) = b(v). trail - no multiple edges circuit - closed trail Lemma balanced E(G) decomposed to alternating circuits Lemma C = v 1, v 2,...v 2n alternating; v i = v j with j i is even. C can be decomposed into two, shorter alternating circuits. v v v
50 Red/blue graphs 2 swap maxc u (G) = # of circuits in a max. circuit decomposition
51 Red/blue graphs 2 swap maxc u (G) = # of circuits in a max. circuit decomposition circuit C is elementary if 1 no vertex appears more than twice in C, 2 i, j s.t. v i and v j occur only once in C and they have different parity (their distance is odd).
52 Red/blue graphs 2 swap maxc u (G) = # of circuits in a max. circuit decomposition circuit C is elementary if 1 no vertex appears more than twice in C, 2 i, j s.t. v i and v j occur only once in C and they have different parity (their distance is odd). Lemma Let C 1,..., C l be a max. size circuit decomposition of G. each circuit is elementary.
53 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times
54 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd
55 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd (iii) vertex v occurring once - INDIRECT with min. distance
56 u 1 u 2 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd (iii) vertex v occurring once - INDIRECT with min. distance v u 1 odd v
57 u 1 u 2 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd (iii) vertex v occurring once - INDIRECT with min. distance v u 1 even v
58 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd (iii) vertex v occurring once - INDIRECT with min. distance v u 1 even v u 1 u 2 (iv) by pigeon hole: 2 vertices occurring once
59 Red/blue graphs 3 swap Proof. (i) no vertex occurs 3 times (ii) when v occurs twice - their distance is odd (iii) vertex v occurring once - INDIRECT with min. distance v u 1 even v u 1 u 2 (iv) by pigeon hole: 2 vertices occurring once (v) by p.h. : u, v occurring once with odd distance
60 One alternating circuit Realizations G 1 and G 2 of d, swap
61 One alternating circuit Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) swap
62 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2.
63 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop
64 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge
65 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph v
66 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 v
67 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 v
68 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 one swap in start graph stop graph did not change; new start graph, with sym. v diff. having 2 edges less
69 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 v
70 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 one swap in stop graph v
71 One alternating circuit swap Realizations G 1 and G 2 of d, take E 1 E 2 = E, and the red/blue graph G = (V, E) Theorem if E(G) is one alternating elementary circuit C of length 2l swap sequence of length l 1 from G 1 to G 2. Proof. G i start (stop) graphs, induction on actual Estart E stop v C occurring once, starting a red edge u red edges miss stop graph if (u, v) E 1, E 2 one swap in stop graph start graph did not change; new stop graph, with sym. v diff. having 2 edges less
72 Shortest swap in undirected case swap G 1 and G 2 realizations of d. dist u (G 1, G 2 ) = length of the shortest swap sequence maxc u (G 1, G 2 ) = # of circuits in a max. circuit decomposition of E 1 E 2
73 Shortest swap in undirected case swap G 1 and G 2 realizations of d. dist u (G 1, G 2 ) = length of the shortest swap sequence maxc u (G 1, G 2 ) = # of circuits in a max. circuit decomposition of E 1 E 2 Theorem (Erdős-Király-Miklós, 2012) For all pairs of realizations G 1, G 2 we have dist u (G 1, G 2 ) = E 1 E 2 2 maxc u (G 1, G 2 ).
74 Shortest swap in undirected case swap G 1 and G 2 realizations of d. dist u (G 1, G 2 ) = length of the shortest swap sequence maxc u (G 1, G 2 ) = # of circuits in a max. circuit decomposition of E 1 E 2 Theorem (Erdős-Király-Miklós, 2012) For all pairs of realizations G 1, G 2 we have dist u (G 1, G 2 ) = E 1 E 2 2 maxc u (G 1, G 2 ). Very probably the values are NP-complete to be computed
75 Shortest swap in undirected case swap G 1 and G 2 realizations of d. dist u (G 1, G 2 ) = length of the shortest swap sequence maxc u (G 1, G 2 ) = # of circuits in a max. circuit decomposition of E 1 E 2 Theorem (Erdős-Király-Miklós, 2012) For all pairs of realizations G 1, G 2 we have dist u (G 1, G 2 ) = E 1 E 2 2 maxc u (G 1, G 2 ). Very probably the values are NP-complete to be computed New upper bound: dist u (G 1, G 2 ) E 1 E 2 2 1
76 Why a shortest swap-? How to find a typical realization of a sequence? swap
77 Why a shortest swap-? How to find a typical realization of a sequence? - large social networks only # of connections known (PC) swap
78 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling
79 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling huge # of realizations - no way to generate all & choose
80 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling huge # of realizations - no way to generate all & choose Sampling realizations uniformly -
81 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling huge # of realizations - no way to generate all & choose Sampling realizations uniformly - MCMC methods
82 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling huge # of realizations - no way to generate all & choose Sampling realizations uniformly - MCMC methods to estimate mixing time - need to know distances
83 Why a shortest swap-? swap How to find a typical realization of a sequence? - large social networks only # of connections known (PC) - online growing network modeling huge # of realizations - no way to generate all & choose Sampling realizations uniformly - MCMC methods to estimate mixing time - need to know distances dist u (G 1, G 2 ) E ( 1 E ) 2 3n ( ) (1 min(d i, V d i ) i ( i ) ( d i 1 4 ) 3n 2 2 3n )
84 Proof of shortest swap length (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) swap
85 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ia) and realizations G 1 = H 0, H 1,..., H k 1, H k = G 2 s.t. i realizations H i and H i+1 differ exactly in C i.
86 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ia) and realizations G 1 = H 0, H 1,..., H k 1, H k = G 2 s.t. i realizations H i and H i+1 differ exactly in C i. - each circuit is elementary - for all pairs H i, H i+1 the previous theorem is applicable
87 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition
88 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
89 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
90 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
91 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
92 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
93 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails.
94 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails. # of circuits unchanged, shorter circuit - contradiction
95 Proof of shortest swap length swap (i) - take a maximal alternating circuit decomposition C 1,..., C maxcu(g 1,G 2 ) (ib) assume shortest circuit C 1 is the shortest among all circuits in all possible minimal circuit decomposition Lemma edge in any other circuits which divides C 1 into two odd-long trails. 1 consider the (actual) symmetric difference, 2 find a maximal circuit decomposition with a shortest elementary circuit, 3 apply the procedure of one elementary circuit, 4 repeat the whole process with the new (and smaller) symmetric difference.
96 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ).
97 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1
98 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one
99 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i
100 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i - find circuit decomposition with i circuits: maxc u (G 1, H i ) E 1 E(H i ) 2 dist u (G 1, H i )
101 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i - find circuit decomposition with i circuits: maxc u (G 1, H i ) E 1 E(H i ) 2 dist u (G 1, H i ) analyze the intersection of E(H i ) E(H i+1 ) with E 1 E(H i )
102 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i - find circuit decomposition with i circuits: maxc u (G 1, H i ) E 1 E(H i ) 2 dist u (G 1, H i ) analyze the intersection of E(H i ) E(H i+1 ) with E 1 E(H i ) empty
103 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i - find circuit decomposition with i circuits: maxc u (G 1, H i ) E 1 E(H i ) 2 dist u (G 1, H i ) analyze the intersection of E(H i ) E(H i+1 ) with E 1 E(H i ) empty not empty
104 Proof of shortest swap length 2 swap (ii) LHS RHS - we realign the inequality: maxc u (G 1, G 2 ) E 1 E 2 2 dist u (G 1, G 2 ). G 1 = H 0, H 1,...,H k 1, H k = G 2 minimum real. sequence i the graphs H i and H i+1 are in swap-distance 1 swap subsequence from H i to H j also a minimum one induction on i - find circuit decomposition with i circuits: maxc u (G 1, H i ) E 1 E(H i ) 2 dist u (G 1, H i ) analyze the intersection of E(H i ) E(H i+1 ) with E 1 E(H i ) empty not empty
105 swap 1 2 swap- 3 4
106 G(U, V; E) simple bipartite graph, bipartite sequence: (l k) bd(g) = ( (a1,..., a k ), ( b1,...,b l ) ), swap
107 swap G(U, V; E) simple bipartite graph, bipartite sequence: (l k) bd(g) = ( (a1,..., a k ), ( b1,...,b l ) ), everything goes through - but be careful - f.e. with swap
108 swap G(U, V; E) simple bipartite graph, bipartite sequence: (l k) bd(g) = ( (a1,..., a k ), ( b1,...,b l ) ), everything goes through - but be careful - f.e. with swap maximum circuit decomposition = set of elementary cycles
109 swap G(U, V; E) simple bipartite graph, bipartite sequence: (l k) bd(g) = ( (a1,..., a k ), ( b1,...,b l ) ), everything goes through - but be careful - f.e. with swap maximum circuit decomposition = set of elementary cycles the cycles can be processed in an arbitrary order
110 swap G(U, V; E) simple bipartite graph, bipartite sequence: (l k) bd(g) = ( (a1,..., a k ), ( b1,...,b l ) ), everything goes through - but be careful - f.e. with swap maximum circuit decomposition = set of elementary cycles the cycles can be processed in an arbitrary order dist u (B 1, B 2 ) E(B 1) E(B 2 ) l 1 ( 2 l 2 min ( ) ) ( 1 a i,l a i 2 1 ) 2l i ( ) l 1 a i. l i
111 swap 1 2 swap- 3 4
112 swap G(X; E) simple directed graph, X = {x 1, x 2,..., x n } dd( G) ( (d + = 1, ) ( d+ 2,...,d+ n, d 1, d 2,..., ) ) d n
113 swap G(X; E) simple directed graph, X = {x 1, x 2,..., x n } dd( G) ( (d + = 1, ) ( d+ 2,...,d+ n, d 1, d 2,..., ) ) d n representative bipartite graph B( G) = (U, V; E) (Gale) u i U - out-edges from v i V in-edges to x i.
114 swap G(X; E) simple directed graph, X = {x 1, x 2,..., x n } dd( G) ( (d + = 1, ) ( d+ 2,...,d+ n, d 1, d 2,..., ) ) d n representative bipartite graph B( G) = (U, V; E) (Gale) u i U - out-edges from v i V in-edges to x i. E ( B( G 1 ) ) E(B ( G2 ) ) v 4 u 3 u 1 v 2
115 swap G(X; E) simple directed graph, X = {x 1, x 2,..., x n } dd( G) ( (d + = 1, ) ( d+ 2,...,d+ n, d 1, d 2,..., ) ) d n representative bipartite graph B( G) = (U, V; E) (Gale) u i U - out-edges from v i V in-edges to x i. E ( B( G 1 ) ) E(B ( G2 ) ) u 3 x 4 v 4 E( G 1 ) E( G 2 ) x 3 u 1 v 2 x 1 x 2
116 Possible problems in E(B 1 ) E(B 2 ) Goal: apply results on bipartite for directed. swap
117 Possible problems in E(B 1 ) E(B 2 ) swap Goal: apply results on bipartite for directed. there are two problems
118 Possible problems in E(B 1 ) E(B 2 ) swap Goal: apply results on bipartite for directed. there are two problems v z u u x v y y, z x where x, y, z V( G)
119 Possible problems in E(B 1 ) E(B 2 ) swap Goal: apply results on bipartite for directed. there are two problems v z u x u v y v z u y u a v x v b u c y, z x where x, y, z V( G) if a = x swap in u a, v b, u c, v x
120 Possible problems in E(B 1 ) E(B 2 ) swap Goal: apply results on bipartite for directed. there are two problems v z u x u v y v z u y u a v x v b u c y, z x where x, y, z V( G) if a = x swap in u a, v b, u c, v x if b y swap in v b, u c, v x, u y
121 Handling elementary circuits(=cycles) (i) u a C s.t. v a C swap
122 Handling elementary circuits(=cycles) (i) u a C s.t. v a C swap u y v x v z u c u a v b
123 Handling elementary circuits(=cycles) (i) u a C s.t. v a C swap u y v x v z u c u a v b if is not an edge
124 Handling elementary circuits(=cycles) (i) u a C s.t. v a C swap u y v x v z u c u a v b
125 Handling elementary circuits(=cycles) (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 swap
126 Handling elementary circuits(=cycles) (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 u b v a v x swap v c u z u x v y if is not an edge
127 Handling elementary circuits(=cycles) (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 u b v a v x swap v c u z u x v y
128 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6
129 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 u 5 v 3 u 4 v 2 u 3 v 4 u 1 v 5 u 2 v 1
130 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 u 5 v 3 u 4 v 2 u 3 v 4 u 1 v 5 u 2 v 1
131 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps
132 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps (iv) if x : if u i = u x C and v i+1 = v x C but C = 6
133 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps (iv) if x : if u i = u x C and v i+1 = v x C but C = 6 u y v x u z v z v y u x
134 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps (iv) if x : if u i = u x C and v i+1 = v x C but C = 6 u y v x u z v z v y u x
135 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps (iv) if x : if u i = u x C and v i+1 = v x C but C = 6 u y v x u z v z v y u x triangular C 6 -swap
136 Handling elementary circuits(=cycles) swap (i) u a C s.t. v a C (ii) if x : u x C v x C but x : v x u x 3 (iii) if x : if u i = u x C and v i+1 = v x C but C > 6 all these swaps are C 4 -swaps (iv) if x : if u i = u x C and v i+1 = v x C but C = 6 u y v x u z v z v y u x triangular C 6 -swap triangular C 6 -swaps can be necessary
137 Analyzing triangular C 6 c e swap b a d G 1 and G 1 on common set of vertices
138 Analyzing triangular C 6 c e swap b a d G 1 and G 1 on common set of vertices
139 Analyzing triangular C 6 c e v e swap a v d u a v c u b u d b d G 1 and G 1 on common set of vertices v b u c v a u e E ( B( G 1 ) ) E ( B( G 1 ) )
140 Analyzing triangular C 6 there are two different alternating cycle decompositions swap
141 Analyzing triangular C 6 swap there are two different alternating cycle decompositions u a v c u b v b u c va u e v a v d u d u a v e
142 Analyzing triangular C 6 there are two different alternating cycle decompositions v e swap u a u c v b u d u a v a u d v b uc v a v e
143 Analyzing triangular C 6 swap Whenever a triangular C 6 kisses another elementary cycle in the decomposition, they can be re-decomposed without triangular C 6
144 Analyzing triangular C 6 swap Whenever a triangular C 6 kisses another elementary cycle in the decomposition, they can be re-decomposed without triangular C 6 Lemma maximum size C of E 1 E 2 having minimum # triangular C 6 Then no triangular C 6 kisses any other cycle.
145 Analyzing triangular C 6 swap Whenever a triangular C 6 kisses another elementary cycle in the decomposition, they can be re-decomposed without triangular C 6 Lemma maximum size C of E 1 E 2 having minimum # triangular C 6 Then no triangular C 6 kisses any other cycle. weighted swap distance weight(c 4 -swap) = 1;
146 Analyzing triangular C 6 swap Whenever a triangular C 6 kisses another elementary cycle in the decomposition, they can be re-decomposed without triangular C 6 Lemma maximum size C of E 1 E 2 having minimum # triangular C 6 Then no triangular C 6 kisses any other cycle. weighted swap distance weight(c 4 -swap) = 1; weight(triangular C 6 -swap) = 2
147 Analyzing triangular C 6 swap Whenever a triangular C 6 kisses another elementary cycle in the decomposition, they can be re-decomposed without triangular C 6 Lemma maximum size C of E 1 E 2 having minimum # triangular C 6 Then no triangular C 6 kisses any other cycle. weighted swap distance weight(c 4 -swap) = 1; weight(triangular C 6 -swap) = 2 Theorem Let dd be a directed sequence with G 1 and G 2 realizations. Then dist d ( G 1, G 2 ) = E 1 E 2 maxc d (G 1, G 2 ). 2
148 M.Drew LaMar s result swap 3-Cycle Anchored Digraphs And Their Application In The Uniform Sampling Of Realizations From A Fixed Degree Sequence, in ACM 2011 Winter Simulation Conference (2011), 1 12.
149 M.Drew LaMar s result swap 3-Cycle Anchored Digraphs And Their Application In The Uniform Sampling Of Realizations From A Fixed Degree Sequence, in ACM 2011 Winter Simulation Conference (2011), Theorem Each directed sequence realization can be transformed into another one with C 4 - and triangular C 6 -swaps
150 M.Drew LaMar s result swap 3-Cycle Anchored Digraphs And Their Application In The Uniform Sampling Of Realizations From A Fixed Degree Sequence, in ACM 2011 Winter Simulation Conference (2011), Theorem Each directed sequence realization can be transformed into another one with C 4 - and triangular C 6 -swaps - allowing all C 6 -swaps with weight 2 we have Theorem dist d ( G 1, G 2 ) can be achieved with C 4 - and triangular C 6 -swaps only
151 Catherine Greenhill s result swap A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, arxiv v4 (2011), 1 48.
152 Catherine Greenhill s result swap A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, arxiv v4 (2011), Theorem for regular DD C 4 -swaps only are sufficient
153 Catherine Greenhill s result swap A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, arxiv v4 (2011), Theorem for regular DD C 4 -swaps only are sufficient a g c a g c d b e d b e
154 Catherine Greenhill s result swap A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, arxiv v4 (2011), Theorem for regular DD C 4 -swaps only are sufficient a g c a g c d b e d b e swap sequence generated by Greenhill cannot be a minimal
155 Catherine Greenhill s result swap A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, arxiv v4 (2011), Theorem for regular DD C 4 -swaps only are sufficient a g c a g c d b e d b e swap sequence generated by Greenhill cannot be a minimal of course this was never a requirement
A simple Havel Hakimi type algorithm to realize graphical degree sequences of directed graphs
simple Havel Hakimi type algorithm to realize graphical degree sequences of directed graphs Péter L. Erdős and István Miklós. Rényi Institute of Mathematics, Hungarian cademy of Sciences, Budapest, PO
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationGeneralized Induced Factor Problems
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationDegree-based graph construction
IOP PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND THEORETICAL J. Phys. A: Math. Theor. 42 (2009) 392001 (10pp) doi:10.1088/1751-8113/42/39/392001 FAST TRACK COMMUNICATION Degree-based graph construction
More informationA 2-factor in which each cycle has long length in claw-free graphs
A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationNon-Separable Detachments of Graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More information8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three
More informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem
MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR 2006 24 April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationCombinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationSHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE
SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationUPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationConnected Identifying Codes for Sensor Network Monitoring
Connected Identifying Codes for Sensor Network Monitoring Niloofar Fazlollahi, David Starobinski and Ari Trachtenberg Dept. of Electrical and Computer Engineering Boston University, Boston, MA 02215 Email:
More informationPh.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationA Graph-Theoretic Network Security Game
A Graph-Theoretic Network Security Game Marios Mavronicolas 1, Vicky Papadopoulou 1, Anna Philippou 1, and Paul Spirakis 2 1 Department of Computer Science, University of Cyprus, Nicosia CY-1678, Cyprus.
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More informationOn the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
More information6.852: Distributed Algorithms Fall, 2009. Class 2
.8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparison-based algorithms. Basic computation in general synchronous networks: Leader election
More informationOn the Sum Necessary to Ensure that a Degree Sequence is Potentially H-Graphic
On the Sum Necessary to Ensure that a Degree Sequence is Potentially H-Graphic Michael J. Ferrara 1,2 Timothy D. LeSaulnier 3 Casey K. Moffatt 1 Paul S. Wenger 4 September 2, 2014 Abstract Given a graph
More informationA Sublinear Bipartiteness Tester for Bounded Degree Graphs
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationThe Clar Structure of Fullerenes
The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, 2013 1 / 25
More informationBy Joseph Blitzstein and Persi Diaconis Stanford University
June 2006 A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES By Joseph Blitzstein and Persi Diaconis Stanford University Random graphs with a given degree sequence
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN. Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015
ONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015 ONLINE STEINER FOREST PROBLEM An initially given graph G. s 1 s 2 A sequence of demands (s i, t i ) arriving
More informationEven Faster Algorithm for Set Splitting!
Even Faster Algorithm for Set Splitting! Daniel Lokshtanov Saket Saurabh Abstract In the p-set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective
More informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationBinary Image Reconstruction
A network flow algorithm for reconstructing binary images from discrete X-rays Kees Joost Batenburg Leiden University and CWI, The Netherlands kbatenbu@math.leidenuniv.nl Abstract We present a new algorithm
More informationCycles and clique-minors in expanders
Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationA Study of Sufficient Conditions for Hamiltonian Cycles
DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.
More informationLecture 7: NP-Complete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationDefinition 11.1. Given a graph G on n vertices, we define the following quantities:
Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationJUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationThe number of generalized balanced lines
The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l
More informationDiscrete Applied Mathematics. The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationTopic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06
CS880: Approximations Algorithms Scribe: Matt Elder Lecturer: Shuchi Chawla Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06 3.1 Set Cover The Set Cover problem is: Given a set of
More informationClique coloring B 1 -EPG graphs
Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More informationOn the Bandwidth of 3-dimensional Hamming graphs
On the Bandwidth of 3-dimensional Hamming graphs J. Balogh S.L. Bezrukov L. H. Harper A. Seress Abstract This paper presents strategies for improving the known upper and lower bounds for the bandwidth
More informationTree-representation of set families and applications to combinatorial decompositions
Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More information(Refer Slide Time: 01.26)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures
More informationHigh degree graphs contain large-star factors
High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationDiscrete Mathematics. Hans Cuypers. October 11, 2007
Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationAn Approximation Algorithm for Bounded Degree Deletion
An Approximation Algorithm for Bounded Degree Deletion Tomáš Ebenlendr Petr Kolman Jiří Sgall Abstract Bounded Degree Deletion is the following generalization of Vertex Cover. Given an undirected graph
More informationGenerating models of a matched formula with a polynomial delay
Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic
More information