Fast Algorithms for Connectivity Problems in Networks
|
|
|
- Marylou Sanders
- 7 years ago
- Views:
Transcription
1 Fast Algorithms for Connectivity Problems in Networks Steiner Cuts, Gomory-Hu Trees, and Edge Splitting Strand Life Sciences 29 May 2008/ MCDES
2 The Setting A network G of n nodes and m edges. Many nodes, relatively fewer connections. Unweighted edges. Redundancy requirement (k) much smaller than n. Reduce algorithms with time complexity O(n 2 ) or more to Õ(n poly(k))
3 The Setting A network G of n nodes and m edges. Many nodes, relatively fewer connections. Unweighted edges. Redundancy requirement (k) much smaller than n. Reduce algorithms with time complexity O(n 2 ) or more to Õ(n poly(k))
4 The Setting A network G of n nodes and m edges. Many nodes, relatively fewer connections. Unweighted edges. Redundancy requirement (k) much smaller than n. Reduce algorithms with time complexity O(n 2 ) or more to Õ(n poly(k))
5 The Setting A network G of n nodes and m edges. Many nodes, relatively fewer connections. Unweighted edges. Redundancy requirement (k) much smaller than n. Reduce algorithms with time complexity O(n 2 ) or more to Õ(n poly(k))
6 The Setting A network G of n nodes and m edges. Many nodes, relatively fewer connections. Unweighted edges. Redundancy requirement (k) much smaller than n. Reduce algorithms with time complexity O(n 2 ) or more to Õ(n poly(k))
7 s t Edge Connectivity/Min-Cut The maximum number of edge disjoint paths between two vertices. Equals the min-cut separating the 2 vertices Can be computed in O(mk) time via Ford-Fulkerson max flows, k is the min-cut size
8 s t Edge Connectivity/Min-Cut The maximum number of edge disjoint paths between two vertices. Equals the min-cut separating the 2 vertices Can be computed in O(mk) time via Ford-Fulkerson max flows, k is the min-cut size
9 s t Edge Connectivity/Min-Cut The maximum number of edge disjoint paths between two vertices. Equals the min-cut separating the 2 vertices Can be computed in O(mk) time via Ford-Fulkerson max flows, k is the min-cut size
10 Global Edge Connectivity/Min-Cut The minimum edge connectivity over all vertex pairs. A global min-cut Best Deterministic Algorithm: O(mk) by Gabow where k is the global min-cut size; near linear Monte Carlo algorithm by Karger.
11 Global Edge Connectivity/Min-Cut The minimum edge connectivity over all vertex pairs. A global min-cut Best Deterministic Algorithm: O(mk) by Gabow where k is the global min-cut size; near linear Monte Carlo algorithm by Karger.
12 Global Edge Connectivity/Min-Cut The minimum edge connectivity over all vertex pairs. A global min-cut Best Deterministic Algorithm: O(mk) by Gabow where k is the global min-cut size; near linear Monte Carlo algorithm by Karger.
13 Steiner Edge Connectivity/Min-Cut S is a subset of interesting Steiner vertices. The minimum edge connectivity over all vertex pairs from S. The min-cut separating vertices in S Question: Is an O(mk) algorithm possible, where k is the Steiner min-cut?
14 Steiner Edge Connectivity/Min-Cut S is a subset of interesting Steiner vertices. The minimum edge connectivity over all vertex pairs from S. The min-cut separating vertices in S Question: Is an O(mk) algorithm possible, where k is the Steiner min-cut?
15 Steiner Edge Connectivity/Min-Cut S is a subset of interesting Steiner vertices. The minimum edge connectivity over all vertex pairs from S. The min-cut separating vertices in S Question: Is an O(mk) algorithm possible, where k is the Steiner min-cut?
16 The Gomory-Hu Tree A tree which carries min-cut information for all pairs of vertices. n 1 max-flow/min-cut computations suffice. Time taken is O(n 3 ) or more. Question: Is Õ(nm) time possible?
17 The Gomory-Hu Tree A tree which carries min-cut information for all pairs of vertices. n 1 max-flow/min-cut computations suffice. Time taken is O(n 3 ) or more. Question: Is Õ(nm) time possible?
18 The Gomory-Hu Tree A tree which carries min-cut information for all pairs of vertices. n 1 max-flow/min-cut computations suffice. Time taken is O(n 3 ) or more. Question: Is Õ(nm) time possible?
19 The Gomory-Hu Tree A tree which carries min-cut information for all pairs of vertices. n 1 max-flow/min-cut computations suffice. Time taken is O(n 3 ) or more. Question: Is Õ(nm) time possible?
20 Gomory-Hu Trees & Steiner Min-Cuts Compute Min-Cut (say Global) Create two recursive sub-problems General Recursive Problem; Steiner Min-Cut
21 Gomory-Hu Trees & Steiner Min-Cuts Compute Min-Cut (say Global) Create two recursive sub-problems General Recursive Problem; Steiner Min-Cut
22 Edge Splitting Pair edges incident on a vertex and remove it Ensure that pairing conserves the global min-cut of the remaining vertices Is this possible at all? Lovasz/Mader: Yes, for eulerian directed graphs and for even degree vertices in undirected graphs
23 Edge Splitting Pair edges incident on a vertex and remove it Ensure that pairing conserves the global min-cut of the remaining vertices Is this possible at all? Lovasz/Mader: Yes, for eulerian directed graphs and for even degree vertices in undirected graphs
24 Edge Splitting Pair edges incident on a vertex and remove it Ensure that pairing conserves the global min-cut of the remaining vertices Is this possible at all? Lovasz/Mader: Yes, for eulerian directed graphs and for even degree vertices in undirected graphs
25 Edge Splitting Pair edges incident on a vertex and remove it Ensure that pairing conserves the global min-cut of the remaining vertices Is this possible at all? Lovasz/Mader: Yes, for eulerian directed graphs and for even degree vertices in undirected graphs
26 Edge Splitting Pair edges incident on a vertex and remove it Ensure that pairing conserves the global min-cut of the remaining vertices Is this possible at all? Lovasz/Mader: Yes, for eulerian directed graphs and for even degree vertices in undirected graphs
27 Edge Splitting and Steiner Min-Cuts Split off all non-steiner vertices Compute global min-cut for what remains in Õ(mk) time.
28 Edge Splitting and Steiner Min-Cuts Split off all non-steiner vertices Compute global min-cut for what remains in Õ(mk) time.
29 Edge Splitting Complexity How fast can one vertex be split off? O(n 2 ) time Karger, Benczur and Õ(nk 2 ) time Gabow How fast can many vertices be split off? Nothing better than plain multiplication known. Is Õ(n polyk) possible?
30 Edge Splitting Complexity How fast can one vertex be split off? O(n 2 ) time Karger, Benczur and Õ(nk 2 ) time Gabow How fast can many vertices be split off? Nothing better than plain multiplication known. Is Õ(n polyk) possible?
31 Edge Splitting Complexity How fast can one vertex be split off? O(n 2 ) time Karger, Benczur and Õ(nk 2 ) time Gabow How fast can many vertices be split off? Nothing better than plain multiplication known. Is Õ(n polyk) possible?
32 Certifying s t and global min-cuts How can one certify a min-cut? s t min-cut by finding edge-disjoint paths. Global min-cut by Edmonds Arborescences
33 Certifying s t and global min-cuts How can one certify a min-cut? s t min-cut by finding edge-disjoint paths. Global min-cut by Edmonds Arborescences
34 Certifying s t and global min-cuts How can one certify a min-cut? s t min-cut by finding edge-disjoint paths. Global min-cut by Edmonds Arborescences
35 Edmonds Arborescences Direct an undirected graph by orienting each edge in both directions. Arborescence: A spanning tree with edges directed away from an arbitrary root Build as many edge-disjoint arborescences as possible rooted at some chosen vertex r Õ(n 2 ) time construction by Gabow.
36 Edmonds Arborescences Direct an undirected graph by orienting each edge in both directions. Arborescence: A spanning tree with edges directed away from an arbitrary root Build as many edge-disjoint arborescences as possible rooted at some chosen vertex r Õ(n 2 ) time construction by Gabow.
37 Edmonds Arborescences Direct an undirected graph by orienting each edge in both directions. Arborescence: A spanning tree with edges directed away from an arbitrary root Build as many edge-disjoint arborescences as possible rooted at some chosen vertex r Õ(n 2 ) time construction by Gabow.
38 Global Min-Cut Characterizations from Edmonds Arborescences Any subset of vertices not containing the root must have in-degree at least 1 in each tree. Existence of k edge-disjoint arborescences implies global min-cut k
39 Global Min-Cut Characterizations from Edmonds Arborescences Any subset of vertices not containing the root must have in-degree at least 1 in each tree. Existence of k edge-disjoint arborescences implies global min-cut k
40 Global Min-Cut Characterizations from Edmonds Arborescences A subset S of vertices s.t. r S, S is contiguous in all trees, and all unused edges directed into S have both endpoints in S, is a global min-cut Gabow s construction shows that such a set exists when no more edge-disjoint arborescences can be conctructed.
41 Global Min-Cut Characterizations from Edmonds Arborescences A subset S of vertices s.t. r S, S is contiguous in all trees, and all unused edges directed into S have both endpoints in S, is a global min-cut Gabow s construction shows that such a set exists when no more edge-disjoint arborescences can be conctructed.
42 Edmonds Directionless Trees Swaps need to be constrained to maintain the arborescence property. Relax the property that edges are directed away from the root. Instead insist that in-degree of a vertex over all directionless trees equals k Existence of k edge-disjoint directionless trees implies global min-cut k Õ(mk) time construction by Gabow.
43 Edmonds Directionless Trees Swaps need to be constrained to maintain the arborescence property. Relax the property that edges are directed away from the root. Instead insist that in-degree of a vertex over all directionless trees equals k Existence of k edge-disjoint directionless trees implies global min-cut k Õ(mk) time construction by Gabow.
44 Edmonds Directionless Trees Swaps need to be constrained to maintain the arborescence property. Relax the property that edges are directed away from the root. Instead insist that in-degree of a vertex over all directionless trees equals k Existence of k edge-disjoint directionless trees implies global min-cut k Õ(mk) time construction by Gabow.
45 Edmonds Directionless Trees Swaps need to be constrained to maintain the arborescence property. Relax the property that edges are directed away from the root. Instead insist that in-degree of a vertex over all directionless trees equals k Existence of k edge-disjoint directionless trees implies global min-cut k Õ(mk) time construction by Gabow.
46 Global Min-Cut Characterizations from Edmonds Directionless Trees A subset S of vertices s.t. r S, S is contiguous in all trees, and all unused edges directed into S having both endpoints in S, is a global min-cut Gabow s construction shows that such a set exists when no more edge-disjoint directionless trees can be constructed.
47 Global Min-Cut Characterizations from Edmonds Directionless Trees A subset S of vertices s.t. r S, S is contiguous in all trees, and all unused edges directed into S having both endpoints in S, is a global min-cut Gabow s construction shows that such a set exists when no more edge-disjoint directionless trees can be constructed.
48 Edmonds Directionless Trees Construction Algorithm Suppose i trees have been constructed and the i + 1th tree is a forest. For each component in the i + 1th tree, run a closure algorithm to identify a subset S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S. If no such subset can be found then a sequence of swaps results in components in the i + 1th tree connecting up. Õ(m) time for the i + 1th tree so Õ(mk) overall; and m can be made O(nk) via Nagamochi-Ibaraki
49 Edmonds Directionless Trees Construction Algorithm Suppose i trees have been constructed and the i + 1th tree is a forest. For each component in the i + 1th tree, run a closure algorithm to identify a subset S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S. If no such subset can be found then a sequence of swaps results in components in the i + 1th tree connecting up. Õ(m) time for the i + 1th tree so Õ(mk) overall; and m can be made O(nk) via Nagamochi-Ibaraki
50 Edmonds Directionless Trees Construction Algorithm Suppose i trees have been constructed and the i + 1th tree is a forest. For each component in the i + 1th tree, run a closure algorithm to identify a subset S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S. If no such subset can be found then a sequence of swaps results in components in the i + 1th tree connecting up. Õ(m) time for the i + 1th tree so Õ(mk) overall; and m can be made O(nk) via Nagamochi-Ibaraki
51 Edmonds Directionless Trees Construction Algorithm Suppose i trees have been constructed and the i + 1th tree is a forest. For each component in the i + 1th tree, run a closure algorithm to identify a subset S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S. If no such subset can be found then a sequence of swaps results in components in the i + 1th tree connecting up. Õ(m) time for the i + 1th tree so Õ(mk) overall; and m can be made O(nk) via Nagamochi-Ibaraki
52 Steiner Min-Cut Algorithm Split-off non-steiner (black) vertices via arbitrary pairing of edges (the global min-cut of the remaining white Steiner vertices could drop in the process) Each edge is actually a path with internal blacks Run Gabow s construction of Edmonds directionless trees on this new graph comprising only whites (ignore blacks)
53 Steiner Min-Cut Algorithm Split-off non-steiner (black) vertices via arbitrary pairing of edges (the global min-cut of the remaining white Steiner vertices could drop in the process) Each edge is actually a path with internal blacks Run Gabow s construction of Edmonds directionless trees on this new graph comprising only whites (ignore blacks)
54 Steiner Min-Cut Algorithm Split-off non-steiner (black) vertices via arbitrary pairing of edges (the global min-cut of the remaining white Steiner vertices could drop in the process) Each edge is actually a path with internal blacks Run Gabow s construction of Edmonds directionless trees on this new graph comprising only whites (ignore blacks)
55 Steiner Min-Cut Algorithm Suppose this culminates in finding a set S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S; S need not be a Steiner min-cut because it need not be contiguous when considering blacks
56 Steiner Min-Cut Algorithm Suppose this culminates in finding a set S of vertices not containing the root, contiguous in all trees, and with all unused edges directed into S having both endpoints in S; S need not be a Steiner min-cut because it need not be contiguous when considering blacks
57 Steiner Min-Cut Algorithm Contd We introduce a mating operation (i.e., revision of pairing) whenever contiguity on blacks is violated This allows closure computation to continue And if black contiguity holds, then S is indeed a Steiner min-cut. And we show how mates can be performed efficiently so the total time stays Õ(nk 2 ), where k is the Steiner min-cut Several technicalities.
58 Steiner Min-Cut Algorithm Contd We introduce a mating operation (i.e., revision of pairing) whenever contiguity on blacks is violated This allows closure computation to continue And if black contiguity holds, then S is indeed a Steiner min-cut. And we show how mates can be performed efficiently so the total time stays Õ(nk 2 ), where k is the Steiner min-cut Several technicalities.
59 Steiner Min-Cut Algorithm Contd We introduce a mating operation (i.e., revision of pairing) whenever contiguity on blacks is violated This allows closure computation to continue And if black contiguity holds, then S is indeed a Steiner min-cut. And we show how mates can be performed efficiently so the total time stays Õ(nk 2 ), where k is the Steiner min-cut Several technicalities.
60 Steiner Min-Cut Algorithm Contd We introduce a mating operation (i.e., revision of pairing) whenever contiguity on blacks is violated This allows closure computation to continue And if black contiguity holds, then S is indeed a Steiner min-cut. And we show how mates can be performed efficiently so the total time stays Õ(nk 2 ), where k is the Steiner min-cut Several technicalities.
61 Splitting-off Vertices in Undirected Graphs Goal: Split-off a specified subset of vertices so global min-cut of the remaining vertices is preserved. Algorithm as above, split-off with arbitrary pairings and then revise pairing via mating
62 Splitting-off Vertices in Undirected Graphs Goal: Split-off a specified subset of vertices so global min-cut of the remaining vertices is preserved. Algorithm as above, split-off with arbitrary pairings and then revise pairing via mating
63 Splitting-off Vertices in Undirected Graphs Complication: this is done on the directed version of the undirected graph; for true undirected splitting-off whenever two directed edges are paired, there reverse edges must be paired as well Coupled Matings required and can be done in Õ(nk 2 ) time.
64 Splitting-off Vertices in Undirected Graphs Complication: this is done on the directed version of the undirected graph; for true undirected splitting-off whenever two directed edges are paired, there reverse edges must be paired as well Coupled Matings required and can be done in Õ(nk 2 ) time.
65 Faster Edmonds Arborescence Construction Goal: Construct k arborescences where k is the global min-cut Algo: Split-off a constant fraction of the vertices, recursively build arborescences for the rest, then put back the split-off vertices Putting back requires that the vertices split-off are independent By Turan s theorem, there is a n/k sized independent set So time taken is Õ(nk 3 ).
66 Faster Edmonds Arborescence Construction Goal: Construct k arborescences where k is the global min-cut Algo: Split-off a constant fraction of the vertices, recursively build arborescences for the rest, then put back the split-off vertices Putting back requires that the vertices split-off are independent By Turan s theorem, there is a n/k sized independent set So time taken is Õ(nk 3 ).
67 Faster Edmonds Arborescence Construction Goal: Construct k arborescences where k is the global min-cut Algo: Split-off a constant fraction of the vertices, recursively build arborescences for the rest, then put back the split-off vertices Putting back requires that the vertices split-off are independent By Turan s theorem, there is a n/k sized independent set So time taken is Õ(nk 3 ).
68 Faster Edmonds Arborescence Construction Goal: Construct k arborescences where k is the global min-cut Algo: Split-off a constant fraction of the vertices, recursively build arborescences for the rest, then put back the split-off vertices Putting back requires that the vertices split-off are independent By Turan s theorem, there is a n/k sized independent set So time taken is Õ(nk 3 ).
69 Faster Edmonds Arborescence Construction Goal: Construct k arborescences where k is the global min-cut Algo: Split-off a constant fraction of the vertices, recursively build arborescences for the rest, then put back the split-off vertices Putting back requires that the vertices split-off are independent By Turan s theorem, there is a n/k sized independent set So time taken is Õ(nk 3 ).
70 Gomory-Hu Tree Construction Find global min-cut Create two Steiner min-cut sub-problems Consider computation tree
71 Gomory-Hu Tree Construction Find global min-cut Create two Steiner min-cut sub-problems Consider computation tree
72 Gomory-Hu Tree Construction Find global min-cut Create two Steiner min-cut sub-problems Consider computation tree
73 Gomory-Hu Tree Construction Consider a leftgoing path in the computation tree New small cuts are identified These are shrunk into single black vertices and split-off So split vertices as they are discovered; vertices to be split are not available in advance
74 Gomory-Hu Tree Construction Consider a leftgoing path in the computation tree New small cuts are identified These are shrunk into single black vertices and split-off So split vertices as they are discovered; vertices to be split are not available in advance
75 Gomory-Hu Tree Construction Consider a leftgoing path in the computation tree New small cuts are identified These are shrunk into single black vertices and split-off So split vertices as they are discovered; vertices to be split are not available in advance
76 Gomory-Hu Tree Construction Consider a leftgoing path in the computation tree New small cuts are identified These are shrunk into single black vertices and split-off So split vertices as they are discovered; vertices to be split are not available in advance
77 Gomory-Hu Tree Construction When a new small cut (black vertex) is discovered, edges incident on it must be paired up for splitting-off Doing so may disconnect existing trees Solution: Directionless Splitting So one leftgoing path takes O(mn) time
78 Gomory-Hu Tree Construction When a new small cut (black vertex) is discovered, edges incident on it must be paired up for splitting-off Doing so may disconnect existing trees Solution: Directionless Splitting So one leftgoing path takes O(mn) time
79 Gomory-Hu Tree Construction When a new small cut (black vertex) is discovered, edges incident on it must be paired up for splitting-off Doing so may disconnect existing trees Solution: Directionless Splitting So one leftgoing path takes O(mn) time
80 Gomory-Hu Tree Construction When a new small cut (black vertex) is discovered, edges incident on it must be paired up for splitting-off Doing so may disconnect existing trees Solution: Directionless Splitting So one leftgoing path takes O(mn) time
81 Gomory-Hu Tree Construction What is the time overall? Partition computation tree into layers The total number of edges in a layer is O(m) (a bit tricky) How many layers are there?
82 Gomory-Hu Tree Construction What is the time overall? Partition computation tree into layers The total number of edges in a layer is O(m) (a bit tricky) How many layers are there?
83 Gomory-Hu Tree Construction What is the time overall? Partition computation tree into layers The total number of edges in a layer is O(m) (a bit tricky) How many layers are there?
84 Gomory-Hu Tree Construction What is the time overall? Partition computation tree into layers The total number of edges in a layer is O(m) (a bit tricky) How many layers are there?
85 Gomory-Hu Trees Construction Choose the root for tree construction randomly O(log n) layers The Gomory-Hu tree can be constructed in Õ(nm) time
86 Gomory-Hu Trees Construction Choose the root for tree construction randomly O(log n) layers The Gomory-Hu tree can be constructed in Õ(nm) time
87 Gomory-Hu Trees Construction Choose the root for tree construction randomly O(log n) layers The Gomory-Hu tree can be constructed in Õ(nm) time
88 The Edge Orientation Problem Given a graph with global min-cut 2k Orient the edges so the resulting directed graph has global min-cut k Challenge: Odd degree vertices cannot be split-off time We show that a minimal graph has sufficiently many even degree vertices Õ(npoly(k)) time algorithm.
89 The Edge Orientation Problem Given a graph with global min-cut 2k Orient the edges so the resulting directed graph has global min-cut k Challenge: Odd degree vertices cannot be split-off time We show that a minimal graph has sufficiently many even degree vertices Õ(npoly(k)) time algorithm.
90 The Edge Orientation Problem Given a graph with global min-cut 2k Orient the edges so the resulting directed graph has global min-cut k Challenge: Odd degree vertices cannot be split-off time We show that a minimal graph has sufficiently many even degree vertices Õ(npoly(k)) time algorithm.
91 The Edge Orientation Problem Given a graph with global min-cut 2k Orient the edges so the resulting directed graph has global min-cut k Challenge: Odd degree vertices cannot be split-off time We show that a minimal graph has sufficiently many even degree vertices Õ(npoly(k)) time algorithm.
92 The Edge Orientation Problem Given a graph with global min-cut 2k Orient the edges so the resulting directed graph has global min-cut k Challenge: Odd degree vertices cannot be split-off time We show that a minimal graph has sufficiently many even degree vertices Õ(npoly(k)) time algorithm.
93 The Survivable Network Design Problem Given a weighted graph Each vertex v has a demand d; v must be connected to every other vertex with at least d edge-disjoint paths. Problem: Find the least weight solution The first sub-quadratic time implementation of the Williamson, Goemans, Mihail, Vazirani algorithm
94 The Survivable Network Design Problem Given a weighted graph Each vertex v has a demand d; v must be connected to every other vertex with at least d edge-disjoint paths. Problem: Find the least weight solution The first sub-quadratic time implementation of the Williamson, Goemans, Mihail, Vazirani algorithm
95 The Survivable Network Design Problem Given a weighted graph Each vertex v has a demand d; v must be connected to every other vertex with at least d edge-disjoint paths. Problem: Find the least weight solution The first sub-quadratic time implementation of the Williamson, Goemans, Mihail, Vazirani algorithm
96 The Survivable Network Design Problem Given a weighted graph Each vertex v has a demand d; v must be connected to every other vertex with at least d edge-disjoint paths. Problem: Find the least weight solution The first sub-quadratic time implementation of the Williamson, Goemans, Mihail, Vazirani algorithm
97 Open Problems Combine splitting-off and sampling (a la Karger) to obtain a Õ(nk) time algorithm for exact/approximate Steiner min-cut Las-Vegas Õ(nk) time algorithm for global Min-Cut
98 Open Problems Combine splitting-off and sampling (a la Karger) to obtain a Õ(nk) time algorithm for exact/approximate Steiner min-cut Las-Vegas Õ(nk) time algorithm for global Min-Cut
99 Collaborators and References Series of joint works with Richard Cole, Anand Balghat, Kavitha T, Debmalya Panigrahy STOC 2003, 2007, SODA 2007, SODA 2008
100 Collaborators and References Series of joint works with Richard Cole, Anand Balghat, Kavitha T, Debmalya Panigrahy STOC 2003, 2007, SODA 2007, SODA 2008
101 And Finally... THANK YOU
Fast Edge Splitting and Edmonds Arborescence Construction for Unweighted Graphs
Fast Edge Splitting and Edmonds Arborescence Construction for Unweighted Graphs Anand Bhalgat Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi Abstract Given an unweighted undirected or directed
Fast Edge Splitting and Edmonds Arborescence Construction for Unweighted Graphs
Fast Edge Splitting and Edmonds Arorescence Construction for Unweighted Graphs Anand Bhalgat Ramesh Hariharan Telikepalli Kavitha Demalya Panigrahi Astract Given an unweighted undirected or directed graph
CS 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
Approximation 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
Max Flow, Min Cut, and Matchings (Solution)
Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes
Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
ONLINE 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
Analysis 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
8.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
CMPSCI611: Approximating MAX-CUT Lecture 20
CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to
A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy
A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy David P. Williamson Anke van Zuylen School of Operations Research and Industrial Engineering, Cornell University,
5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
Social 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
CIS 700: algorithms for Big Data
CIS 700: algorithms for Big Data Lecture 6: Graph Sketching Slides at http://grigory.us/big-data-class.html Grigory Yaroslavtsev http://grigory.us Sketching Graphs? We know how to sketch vectors: v Mv
Attacking Anonymized Social Network
Attacking Anonymized Social Network From: Wherefore Art Thou RX3579X? Anonymized Social Networks, Hidden Patterns, and Structural Steganography Presented By: Machigar Ongtang (Ongtang@cse.psu.edu ) Social
arxiv:1412.2333v1 [cs.dc] 7 Dec 2014
![arxiv:1412.2333v1 [cs.dc] 7 Dec 2014](/thumbs/30/14559573.jpg "arxiv:1412.2333v1 [cs.dc] 7 Dec 2014")
Minimum-weight Spanning Tree Construction in O(log log log n) Rounds on the Congested Clique Sriram V. Pemmaraju Vivek B. Sardeshmukh Department of Computer Science, The University of Iowa, Iowa City,
Network Flow I. Lecture 16. 16.1 Overview. 16.2 The Network Flow Problem
Lecture 6 Network Flow I 6. Overview In these next two lectures we are going to talk about an important algorithmic problem called the Network Flow Problem. Network flow is important because it can be
Disjoint Compatible Geometric Matchings
Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
Lecture 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
Lecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
Distributed Computing over Communication Networks: Maximal Independent Set
Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.
Even 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
Graph 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
Definition 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
Topology-based network security
Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the
A 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
136 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
The 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 }
Lecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ABSTACT Mohit Singh Tepper School of Business Carnegie Mellon University Pittsburgh, PA USA mohits@andrew.cmu.edu In the MINIMUM
CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.
Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure
Minimum cost maximum flow, Minimum cost circulation, Cost/Capacity scaling
6.854 Advanced Algorithms Lecture 16: 10/11/2006 Lecturer: David Karger Scribe: Kermin Fleming and Chris Crutchfield, based on notes by Wendy Chu and Tudor Leu Minimum cost maximum flow, Minimum cost circulation,
On 2-vertex-connected orientations of graphs
On 2-vertex-connected orientations of graphs Zoltán Szigeti Laboratoire G-SCOP INP Grenoble, France 12 January 2012 Joint work with : Joseph Cheriyan (Waterloo) and Olivier Durand de Gevigney (Grenoble)
Euler Paths and Euler Circuits
Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and
Steiner Tree Approximation via IRR. Randomized Rounding
Steiner Tree Approximation via Iterative Randomized Rounding Graduate Program in Logic, Algorithms and Computation μπλ Network Algorithms and Complexity June 18, 2013 Overview 1 Introduction Scope Related
Algorithm 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;
Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique
SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE
SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS
V. 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
Network Design with Coverage Costs
Network Design with Coverage Costs Siddharth Barman 1 Shuchi Chawla 2 Seeun William Umboh 2 1 Caltech 2 University of Wisconsin-Madison APPROX-RANDOM 2014 Motivation Physical Flow vs Data Flow vs. Commodity
MapReduce and Distributed Data Analysis. Sergei Vassilvitskii Google Research
MapReduce and Distributed Data Analysis Google Research 1 Dealing With Massive Data 2 2 Dealing With Massive Data Polynomial Memory Sublinear RAM Sketches External Memory Property Testing 3 3 Dealing With
THE PROBLEM WORMS (1) WORMS (2) THE PROBLEM OF WORM PROPAGATION/PREVENTION THE MINIMUM VERTEX COVER PROBLEM
1 THE PROBLEM OF WORM PROPAGATION/PREVENTION I.E. THE MINIMUM VERTEX COVER PROBLEM Prof. Tiziana Calamoneri Network Algorithms A.y. 2014/15 2 THE PROBLEM WORMS (1)! A computer worm is a standalone malware
Tree-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
Persistent Data Structures
6.854 Advanced Algorithms Lecture 2: September 9, 2005 Scribes: Sommer Gentry, Eddie Kohler Lecturer: David Karger Persistent Data Structures 2.1 Introduction and motivation So far, we ve seen only ephemeral
A 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:
Degree-3 Treewidth Sparsifiers
Degree-3 Treewidth Sparsifiers Chandra Chekuri Julia Chuzhoy Abstract We study treewidth sparsifiers. Informally, given a graph G of treewidth k, a treewidth sparsifier H is a minor of G, whose treewidth
Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions Chaojun Li. Advised by: Dave Mount. May 22, 2014
Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions Chaojun Li Advised by: Dave Mount May 22, 2014 1 INTRODUCTION In this report we consider the implementation of an efficient
Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013
Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually
Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
Discuss the size of the instance for the minimum spanning tree problem.
3.1 Algorithm complexity The algorithms A, B are given. The former has complexity O(n 2 ), the latter O(2 n ), where n is the size of the instance. Let n A 0 be the size of the largest instance that can
3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
GRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between
Online Degree-Bounded Steiner Network Design
Online Degree-Bounded Steiner Network Design The problem of satisfying connectivity demands on a graph while respecting given constraints has been a pillar of the area of network design since the early
The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,
The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints
Midterm 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
Triangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
Energy-efficient communication in multi-interface wireless networks
Energy-efficient communication in multi-interface wireless networks Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou Research Academic Computer Technology Institute
The Binary Blocking Flow Algorithm. Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/
The Binary Blocking Flow Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Why this Max-Flow Talk? The result: O(min(n 2/3, m 1/2 )mlog(n 2 /m)log(u))
1. Nondeterministically guess a solution (called a certificate) 2. Check whether the solution solves the problem (called verification)
Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms
Connectivity 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
Guessing Game: NP-Complete?
Guessing Game: NP-Complete? 1. LONGEST-PATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES 2. SHORTEST-PATH: Given a graph G = (V, E), does there exists a simple
! 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
Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets
Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets VENKATESH RAMAN, SAKET SAURABH, AND C. R. SUBRAMANIAN The Institute of Mathematical Sciences Abstract. A feedback vertex set
How To Solve A K Path In Time (K)
What s next? Reductions other than kernelization Dániel Marx Humboldt-Universität zu Berlin (with help from Fedor Fomin, Daniel Lokshtanov and Saket Saurabh) WorKer 2010: Workshop on Kernelization Nov
Small Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
! 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
Scheduling 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
Combinatorial 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
On the Multiple Unicast Network Coding Conjecture
On the Multiple Unicast Networ Coding Conjecture Michael Langberg Computer Science Division Open University of Israel Raanana 43107, Israel miel@openu.ac.il Muriel Médard Research Laboratory of Electronics
Part 2: Community Detection
Chapter 8: Graph Data Part 2: Community Detection Based on Leskovec, Rajaraman, Ullman 2014: Mining of Massive Datasets Big Data Management and Analytics Outline Community Detection - Social networks -
Exponential 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].
Online Bipartite Perfect Matching With Augmentations
Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, and Henry Lin Information Theory and Applications Center, U.C. San Diego Email: kamalika@soe.ucsd.edu
Discrete 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
A Practical Scheme for Wireless Network Operation
A Practical Scheme for Wireless Network Operation Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros June 21, 2004 Abstract In many problems in wireline networks, it is known that achieving
root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain
inary Trees 1 A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each
The Binary Blocking Flow Algorithm. Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/
The Binary Blocking Flow Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Theory vs. Practice In theory, there is no difference between theory and practice.
2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]
![2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]](/thumbs/40/21097758.jpg "2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]")
Code No: R05220502 Set No. 1 1. (a) Describe the performance analysis in detail. (b) Show that f 1 (n)+f 2 (n) = 0(max(g 1 (n), g 2 (n)) where f 1 (n) = 0(g 1 (n)) and f 2 (n) = 0(g 2 (n)). [8+8] 2. (a)
Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:
CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm
Lecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
Graph theoretic techniques in the analysis of uniquely localizable sensor networks
Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of
On 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
Online Adwords Allocation
Online Adwords Allocation Shoshana Neuburger May 6, 2009 1 Overview Many search engines auction the advertising space alongside search results. When Google interviewed Amin Saberi in 2004, their advertisement
Finding 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
Strong and Weak Ties
Strong and Weak Ties Web Science (VU) (707.000) Elisabeth Lex KTI, TU Graz April 11, 2016 Elisabeth Lex (KTI, TU Graz) Networks April 11, 2016 1 / 66 Outline 1 Repetition 2 Strong and Weak Ties 3 General
Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li
Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order
Quantum and Non-deterministic computers facing NP-completeness
Quantum and Non-deterministic computers facing NP-completeness Thibaut University of Vienna Dept. of Business Administration Austria Vienna January 29th, 2013 Some pictures come from Wikipedia Introduction
Adaptive Linear Programming Decoding
Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006
Graphs 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
Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
![Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there](/thumbs/26/8879625.jpg "Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there")
- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
Data Structures and Algorithms Written Examination
Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where
On the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
Problem Set 7 Solutions
8 8 Introduction to Algorithms May 7, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Handout 25 Problem Set 7 Solutions This problem set is due in
Lecture 10 Union-Find The union-nd data structure is motivated by Kruskal's minimum spanning tree algorithm (Algorithm 2.6), in which we needed two operations on disjoint sets of vertices: determine whether
Exploring contact patterns between two subpopulations
Exploring contact patterns between two subpopulations Winfried Just Hannah Callender M. Drew LaMar December 23, 2015 In this module 1 we introduce a construction of generic random graphs for a given degree
SHARP 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.,
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees DAVID R. KARGER Stanford University, Stanford, California PHILIP N. KLEIN Brown Unilerslty, Providence, Rhode Island AND ROBERT E. TARJAN
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend