Small distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao
|
|
- Shannon Stone
- 5 years ago
- Views:
Transcription
1 Small distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao presented by Fjóla Rún Björnsdóttir CSE Metric Embeddings Winter 2007 CSE Metric Embeddings - Winter 2007 p. 1/2
2 Overview Definitions Main Results Proof Further Results Open Problems CSE Metric Embeddings - Winter 2007 p. 2/2
3 Main Result Definition. Let G be a class of graphs and let G G. A graph metric is the shortest distance metric d on the vertices V (G) of G. Definition. A planar metric is a graph metric on the class of all planar graphs. Theorem. (Rao s Theorem) Any finite planar metric of cardinality n can be embedded into l 2 with distortion O( log n). This improves on the general O(log n) distortion bound obtained by Bourgain for all metrics. CSE Metric Embeddings - Winter 2007 p. 3/2
4 Proof - Outline We will outline a decomposition method which has some nice properties (for planar graphs in particular) a repeated number of decompositions provide coordinates for embedding distant vertices will have independent coordinates Each decomposition satisfies our purpose with a constant probability We then estimate the distortion of the composed embedding CSE Metric Embeddings - Winter 2007 p. 4/2
5 Decomposition Pick {1,2,4,...n} Pick v 0 V (G) arbitrarily Pick r {0,1, 2,... 1} uniformly at random Let S 1 = {v V (G) : d(v 0,v) r (mod )} Partition G \ S 1 into connected components For each component, repeat this procedure twice (with the same ) Let finally S = S 1 S 2 S 3 Decomposition is connected components of G\S CSE Metric Embeddings - Winter 2007 p. 5/2
6 Properties Each connected component in the decomposition has diameter at most O( ) This results from a theorem by Klein, Plotkin and Rao We will sketch the proof shortly For each x V (G) we have P[d(x,S) c 1 ] c 2 Given a, d(v 1,x) (mod ) will depend upon the choice of BFS-tree root v 1 CSE Metric Embeddings - Winter 2007 p. 6/2
7 Property 1 - Outline of proof We do a proof by contradiction We assume the existence of a component of diameter greater than k We will use the BFS-trees on which we constructed the decomposition to expose a K 3,3 minor in G This implies that the graph can not be planar The diameter of each component therefore has to be bounded CSE Metric Embeddings - Winter 2007 p. 7/2
8 Property 1 - Proofsketch Suppose there is a component C containing u, v such that d(u, v) 34 Let w be the midpoint of the path between them (within C) d(u, w), d(w, v) 17 Let v 3 be the root of the last BFS-tree used to obtain the component disjoint paths ut 1, wt 2, vt 3 of length 4 in the tree Let h 1,h 2,h 3 be their midpoints, i.e. d(u, h 1 ) = 2, etc We then have that d(h i, h j ) > 12 for all i j CSE Metric Embeddings - Winter 2007 p. 8/2
9 Property 1 - Diagram v C w u h h3 2 t1 h2 2 t3 t2 T3 v3 CSE Metric Embeddings - Winter 2007 p. 9/2
10 Property 1 - Proofsketch Now, let v 2 be the root of the BFS-tree of the previous level It has disjoint paths h 1 t 1, h 2 t 2, h 3 t 3 of length 4 and if we let h 1,h 2,h 3 be their midpoints d(h i,h j) > 8 for all i j Similarly, for the first BF S-tree of the decomposition Look at disjoint paths in the tree Define h 1,h 2,h 3 as before h 1,h 2,h 3 are pairwise more than 4 apart CSE Metric Embeddings - Winter 2007 p. 10/2
11 Property 1 - Diagram 2 v2 T2 t 1 t 3 t 2 h 3 h 2 h v C >12 2 w h3 > > u 0 12 h1 h2 v3 CSE Metric Embeddings - Winter 2007 p. 11/2
12 Property 1 - Diagram 3 v2 v1 T1 t 3 t 2 t 1 h 3 h 2 h >8 h 1 h 3 > v > C w h u 0 1 h1 h 2 h2 v3 CSE Metric Embeddings - Winter 2007 p. 12/2
13 Red super nodes Definition. A super node of a graph G is a connected subgraph Let us define the following red super nodes: A(v 1 ), A(v 2 ), A(v 3 ) A(v 3 ) is the union of three paths of the tree T 3 from the root v 3 to vertices t 1, t 2, t 3 (but not including t 1, t 2, t 3 ) each of t 1, t 2, t 3 is at distance 4 from one of u, v, w Similarly, define A(v 2 ), A(v 1 ) with respect to the t i s and t i s CSE Metric Embeddings - Winter 2007 p. 13/2
14 Blue super nodes Let us define the following blue super nodes: A(u) is the union of A(u), A(v), A(w) the path on tree T 3 joining u and t 1 the path on tree T 2 joining h 1 and t 1 the path on tree T 1 joining h 1 and t 1 A(v) and A(w) are defined similarly CSE Metric Embeddings - Winter 2007 p. 14/2
15 Super nodes v2 v1 h 1 h 3 h v C w h u 0 1 h1 h2 v3 CSE Metric Embeddings - Winter 2007 p. 15/2
16 Super nodes are disjoint Claim. A(u), A(v), A(w) (Blue super nodes) are pairwise disjoint Proof. Each blue node is only 8 in diameter (see diagram) Yet, they each contain one of u, v, w, any two of which are > 16 apart Claim. A(v 1 ), A(v 2 ), A(v 3 ) (Red super nodes) are pairwise disjoint Proof. A(v 1 ), A(v 2 ), A(v 3 ) are separated by the decomposition Each of h 1, h 2, h 3 is > 4 away from A(v 2 ) Thus A(v 2 ) T 3 = and a fortiori A(v 2 ) A(v 3 ) = Same argument applies to A(v 1 ) with respect to either of A(v 2 ) and A(v 3 ) Finally, similar arguments will show that any red super node is disjoint from any blue super node CSE Metric Embeddings - Winter 2007 p. 16/2
17 Super nodes v3 v1 v2 u w v h1 h2 h3 h 3 h 1 h 2 C t 3 t 2 t 1 t 2 t 3 t 1 t2 t3 t1 CSE Metric Embeddings - Winter 2007 p. 17/2
18 Red nodes, blue nodes Claim. A(v 1 ) is disjoint from blue nodes A(u), A(v), A(w) Proof. Visibly, the parts that belong to trees T 2 and T 3 can not intersect with A(v 1 ) (because they are all within the same 1 levels of vertices 4 apart from A(v 1 )) Question is: could a vertex x of A(v 1 ) belong to one of t 1h 1, t 2h 2, t Then, d(x, h 1) 4, thus d(x, u) 8 2h 2, say t 1h 1? Without loss of generality, let s say x is on path v 1 h 2 Now d(x, h 2) 5 1 (because h 1 and h 2 are within consecutive 1 levels) So, d(x, v) 9 1 and thus d(u, v) 17 1, a contradiction CSE Metric Embeddings - Winter 2007 p. 18/2
19 Red nodes, blue nodes Claim. A(v 2 ) is disjoint from blue nodes A(u), A(v), A(w) Proof. Repeating the arguments for A(v 1 ), we only need to worry about paths t 1h 1, t 2h 2, t 2h 2 intersecting A(v 2) Pick an x in T 2 on t 1h 1 and y in A(v 2) Without loss of generality, let s say y is on path v 2 h 2 Then, restricting our distance metric to T 2 we get: d(v 2, x) d(v 2, h 1) ( 1) (consecutive 1 levels) So, d(v 2, x) d(v 2, h 1 ) 2 ( 1) = d(v 2, h 1 ) But then d(v 2, x) d(v 2, h 2 ) ( 1) = d(v 2, h 2 ) But, y being in A(v 2 ), d(y, h 2 ) 4, so d(v 2, h 2 ) d(v 2, y) + 2 Thus, d(v 2, x) d(v 2, y) + 2, x and y are therefore distinct CSE Metric Embeddings - Winter 2007 p. 19/2
20 Red nodes, blue nodes Claim. A(v 3 ) is disjoint from blue nodes A(u), A(v), A(w) Proof. The exact same technique as in the previous proof covers all the cases we need to consider... CSE Metric Embeddings - Winter 2007 p. 20/2
21 Property 1 - End of Proofsketch By contracting the super nodes, we observe a K 3,3 This violates the assumption of the graph being planar (Kuratowski) For each component C, we have Diam(C) < 34 By induction, Klein, Plotkin and Rao in their paper actually proof the following stronger statement: Theorem. If G excludes K r,r as a minor, any connected component obtained through r iterations of the described decomposition method has diameter O(r 3 ) CSE Metric Embeddings - Winter 2007 p. 21/2
22 Properties Given a random decomposition, with parameter Each component in the decomposition has diameter at most O( ) For each x V (G) we have P[d(x, S) c 1 ] c 2 We now furthermore have: For any x, y V (G), with d(x, y) 34 x, y / S with constant probability x, y are in different connected components C i, C j d(x, S), d(y, S) c 1 with constant probability Now, for r i, r j random numbers chosen uniformly from [1, 2] r i d(x, S) r j d(y, S) c 1 with constant probability CSE Metric Embeddings - Winter 2007 p. 22/2
23 Embedding We will now define the embedding: For each {2 j 1 2 j Diam(G)} perform 4 log n random decompositions For each component C k in a decomposition uniformly pick a random r k from [1, 2] For x C k define its coordinate as r k d(x,s) This defines a mapping f,i : x r k d(x,s) for all and all i {2 j 1 2 j log n} Finally, let f : x «1 2log n f,i(x) :, i CSE Metric Embeddings - Winter 2007 p. 23/2
24 Embedding The embedding is a contraction Let x, y in V (G), then f(x) f(y) 2 =,i 1 (2 log n) 2 (f,i(x) f,i (y)) log 2 n (2d(x, y)) 2,i 1 4 log 2 n 4 log2 n(4d(x, y) 2 ) = d(x, y) 2 CSE Metric Embeddings - Winter 2007 p. 24/2
25 Embedding The embedding has distortion O( log n) Let x, y in V (G), and pick a such that 34 < d(x, y) < 68 then f(x) f(y) 2 i 1 (2 log n) 2 (f,i(x) f,i (y)) 2 i 1 (Ω(1)d(x, y))2 (2 log n) 2 1 (d(x, y))2 Ω(1) log n CSE Metric Embeddings - Winter 2007 p. 25/2
26 Applications Using this result, we can obtain a O( log n)-approximative max flow min cut theorem for multicommodity flow problems in planar graphs CSE Metric Embeddings - Winter 2007 p. 26/2
27 Further results Definition. For a set of k points S in R L the volume Evol(S) is the k 1 dimensional l 2 - volume of the convex hull of S Definition. The volume of a k-point metric space (S,d) is V ol(s) = sup f:s l 2 Evol(f(S)) (the maximum being taken over all contractions f ) CSE Metric Embeddings - Winter 2007 p. 27/2
28 Further results Definition. A (k,c)-volume preserving embedding of a metric space (S,d) is a contraction f : X l 2 where for all P S with P = k, (1) ( ) 1/(k 1) V ol(s) c Evol(f(S) The k-distortion of f is (2) ( ) 1/(k 1) V ol(s) sup P S, P =k Evol(f(S) With the help of some results from Feige, we can prove the following: Theorem. Rao s Theorem For every finite planar metric of cardinality n there exists a (k,c)-volume preserving embedding of k-distortion O( log n) CSE Metric Embeddings - Winter 2007 p. 28/2
29 References S. Rao. Small distortion and volume preserving embeddings for planar and euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry, ACM Press, 1999 P. Klein, S. Rao and S. Plotkin. Excluded minors, network decompositions, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993 U. Feige. Approximating the bandwidth via volume respecting embeddings. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998 J. Matousek. Lectures on Discrete Geometry. Springer-Verlag, New York, 2002 CSE Metric Embeddings - Winter 2007 p. 29/2
Lecture 10: Bourgain s Theorem
princeton u. sp 0 cos 598B: algorithms and complexity Lecture 10: Bourgain s Theorem Lecturer: Sanjeev Arora Scribe:Daniel J. Peng The goal of this week s lecture is to prove the l version of Bourgain
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationFréchet embeddings of negative type metrics
Fréchet embeddings of negative type metrics Sanjeev Arora James R Lee Assaf Naor Abstract We show that every n-point metric of negative type (in particular, every n-point subset of L 1 ) admits a Fréchet
More informationOn Stochastic Decompositions of Metric Spaces
On Stochastic Decompositions of Metric Spaces Scribe of a talk given at the fall school Metric Embeddings : Constructions and Obstructions. 3-7 November 204, Paris, France Ofer Neiman Abstract In this
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationPartitioning Metric Spaces
Partitioning Metric Spaces Computational and Metric Geometry Instructor: Yury Makarychev 1 Multiway Cut Problem 1.1 Preliminaries Definition 1.1. We are given a graph G = (V, E) and a set of terminals
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationGIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS
GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown,
More informationProperties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
More informationScribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016
CS 267 Lecture 7 Graph Spanners Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016 1 Graph Spanners Our goal is to compress information about distances in a graph by looking
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More informationAn Improved Approximation Algorithm for Requirement Cut
An Improved Approximation Algorithm for Requirement Cut Anupam Gupta Viswanath Nagarajan R. Ravi Abstract This note presents improved approximation guarantees for the requirement cut problem: given an
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationMetric structures in L 1 : Dimension, snowflakes, and average distortion
Metric structures in L : Dimension, snowflakes, and average distortion James R. Lee U.C. Berkeley and Microsoft Research jrl@cs.berkeley.edu Assaf Naor Microsoft Research anaor@microsoft.com Manor Mendel
More informationA Separator Theorem for Graphs with an Excluded Minor and its Applications
A Separator Theorem for Graphs with an Excluded Minor and its Applications Noga Alon IBM Almaden Research Center, San Jose, CA 95120,USA and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel
More informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More informationLecture 18: March 15
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 18: March 15 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More informationREU 2007 Transfinite Combinatorics Lecture 9
REU 2007 Transfinite Combinatorics Lecture 9 Instructor: László Babai Scribe: Travis Schedler August 10, 2007. Revised by instructor. Last updated August 11, 3:40pm Note: All (0, 1)-measures will be assumed
More informationMINIMAL GRAPHS PART I: EXISTENCE OF LIPSCHITZ WEAK SOLUTIONS TO THE DIRICHLET PROBLEM WITH C 2 BOUNDARY DATA
MINIMAL GRAPHS PART I: EXISTENCE OF LIPSCHITZ WEAK SOLUTIONS TO THE DIRICHLET PROBLEM WITH C 2 BOUNDARY DATA SPENCER HUGHES In these notes we prove that for any given smooth function on the boundary of
More information15-854: Approximation Algorithms Lecturer: Anupam Gupta Topic: Approximating Metrics by Tree Metrics Date: 10/19/2005 Scribe: Roy Liu
15-854: Approximation Algorithms Lecturer: Anupam Gupta Topic: Approximating Metrics by Tree Metrics Date: 10/19/2005 Scribe: Roy Liu 121 Introduction In this lecture, we show how to embed metric weighted
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationAlgorithms, Geometry and Learning. Reading group Paris Syminelakis
Algorithms, Geometry and Learning Reading group Paris Syminelakis October 11, 2016 2 Contents 1 Local Dimensionality Reduction 5 1 Introduction.................................... 5 2 Definitions and Results..............................
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More informationOn metric characterizations of some classes of Banach spaces
On metric characterizations of some classes of Banach spaces Mikhail I. Ostrovskii January 12, 2011 Abstract. The first part of the paper is devoted to metric characterizations of Banach spaces with no
More informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
More informationOn the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces
On the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces Dona-Maria Ivanova under the direction of Mr. Zhenkun Li Department of Mathematics Massachusetts Institute of Technology
More informationGRAPH SEARCHING, AND A MIN-MAX THEOREM FOR TREE-WIDTH. P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA. and
GRAPH SEARCHING, AND A MIN-MAX THEOREM FOR TREE-WIDTH P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA and Robin Thomas* School of Mathematics Georgia Institute of Technology Atlanta,
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationMinimization of Symmetric Submodular Functions under Hereditary Constraints
Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile April 4th, 2012 1 of 21 Outline Background Minimal Minimizers and
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationAugmenting Outerplanar Graphs to Meet Diameter Requirements
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia Augmenting Outerplanar Graphs to Meet Diameter Requirements Toshimasa Ishii Department of Information
More informationDiscrete Wiskunde II. Lecture 5: Shortest Paths & Spanning Trees
, 2009 Lecture 5: Shortest Paths & Spanning Trees University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Shortest Path Problem "#$%&'%()*%"()$#+,&- Given directed "#$%&'()*+,%+('-*.#/'01234564'.*,'7+"-%/8',&'5"4'84%#3
More informationLecture 2: A Las Vegas Algorithm for finding the closest pair of points in the plane
Randomized Algorithms Lecture 2: A Las Vegas Algorithm for finding the closest pair of points in the plane Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Randomized
More informationeigenvalue bounds and metric uniformization Punya Biswal & James R. Lee University of Washington Satish Rao U. C. Berkeley
eigenvalue bounds and metric uniformization Punya Biswal & James R. Lee University of Washington Satish Rao U. C. Berkeley separators in planar graphs Lipton and Tarjan (1980) showed that every n-vertex
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationLecture 21 November 11, 2014
CS 224: Advanced Algorithms Fall 2-14 Prof. Jelani Nelson Lecture 21 November 11, 2014 Scribe: Nithin Tumma 1 Overview In the previous lecture we finished covering the multiplicative weights method and
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linear-space, nearly linear-time algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationMetric decomposition, smooth measures, and clustering
Metric decomposition, smooth measures, and clustering James R. Lee U.C. Berkeley jrl@cs.berkeley.edu Assaf Naor Microsoft Research anaor@microsoft.com Abstract In recent years, randomized decompositions
More informationCuts & Metrics: Multiway Cut
Cuts & Metrics: Multiway Cut Barna Saha April 21, 2015 Cuts and Metrics Multiway Cut Probabilistic Approximation of Metrics by Tree Metric Cuts & Metrics Metric Space: A metric (V, d) on a set of vertices
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationNested Cycles in Large Triangulations and Crossing-Critical Graphs
Nested Cycles in Large Triangulations and Crossing-Critical Graphs César Hernández Vélez 1, Gelasio Salazar,1, and Robin Thomas,2 1 Instituto de Física, Universidad Autónoma de San Luis Potosí. San Luis
More informationarxiv:cs/ v1 [cs.cc] 7 Sep 2006
Approximation Algorithms for the Bipartite Multi-cut problem arxiv:cs/0609031v1 [cs.cc] 7 Sep 2006 Sreyash Kenkre Sundar Vishwanathan Department Of Computer Science & Engineering, IIT Bombay, Powai-00076,
More informationMetric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces. f injective mapping from M 1 to M 2. M 2 dominates M 1 under f if d M1 (u; v) d M
Approximating a nite metric by a small number of tree metrics Moses Charikar Chandra Chekuri Ashish Goel Sudipto Guha Serge Plotkin Metric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces.
More informationNon-Asymptotic Theory of Random Matrices Lecture 4: Dimension Reduction Date: January 16, 2007
Non-Asymptotic Theory of Random Matrices Lecture 4: Dimension Reduction Date: January 16, 2007 Lecturer: Roman Vershynin Scribe: Matthew Herman 1 Introduction Consider the set X = {n points in R N } where
More informationMaximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities
Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities Yipu Wang University of Illinois at Urbana-Champaign ywang298@illinois.edu July 12, 2018 Abstract We
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke January 8, 007 A non-empty class A of labelled graphs that is closed under isomorphism is weakly addable if for each graph
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke July 6, 008 A non-empty class A of labelled graphs is weakly addable if for each graph G A and any two distinct components
More informationOn disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
More informationHardness of Embedding Metric Spaces of Equal Size
Hardness of Embedding Metric Spaces of Equal Size Subhash Khot and Rishi Saket Georgia Institute of Technology {khot,saket}@cc.gatech.edu Abstract. We study the problem embedding an n-point metric space
More informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationMetric Spaces Lecture 17
Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =
More informationSpeeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees
Speeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees Bernhard Fuchs Center for Applied Computer Science Cologne (ZAIK) University of Cologne, Weyertal 80, 50931 Köln, Germany Walter Kern
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationEXCLUDING SUBDIVISIONS OF INFINITE CLIQUES. Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
EXCLUDING SUBDIVISIONS OF INFINITE CLIQUES Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown, New
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationBasic Properties of Metric and Normed Spaces
Basic Properties of Metric and Normed Spaces Computational and Metric Geometry Instructor: Yury Makarychev The second part of this course is about metric geometry. We will study metric spaces, low distortion
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationRestricted b-matchings in degree-bounded graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationThe Matching Polytope: General graphs
8.433 Combinatorial Optimization The Matching Polytope: General graphs September 8 Lecturer: Santosh Vempala A matching M corresponds to a vector x M = (0, 0,,, 0...0) where x M e is iff e M and 0 if e
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationFolder complexes and multiflow combinatorial dualities
Folder complexes and multiflow combinatorial dualities Hiroshi HIRAI Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, 113-8656,
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More information1 Some loose ends from last time
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Kruskal s and Borůvka s MST algorithms September 20, 2010 1 Some loose ends from last time 1.1 A lemma concerning greedy algorithms and
More informationTHE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE 1. INTRODUCTION
THE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE AHMAD ABDI AND BERTRAND GUENIN ABSTRACT. It is proved that the lines of the Fano plane and the odd circuits of K 5 constitute the only minimally
More informationContents Lecture 4. Greedy graph algorithms Dijkstra s algorithm Prim s algorithm Kruskal s algorithm Union-find data structure with path compression
Contents Lecture 4 Greedy graph algorithms Dijkstra s algorithm Prim s algorithm Kruskal s algorithm Union-find data structure with path compression Jonas Skeppstedt (jonasskeppstedt.net) Lecture 4 2018
More informationNew algorithms for Disjoint Paths and Routing Problems
New algorithms for Disjoint Paths and Routing Problems Chandra Chekuri Dept. of Computer Science Univ. of Illinois (UIUC) Menger s Theorem Theorem: The maximum number of s-t edgedisjoint paths in a graph
More informationFuchsian groups. 2.1 Definitions and discreteness
2 Fuchsian groups In the previous chapter we introduced and studied the elements of Mob(H), which are the real Moebius transformations. In this chapter we focus the attention of special subgroups of this
More informationEilenberg-Steenrod properties. (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, )
II.3 : Eilenberg-Steenrod properties (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, 8.3 8.5 Definition. Let U be an open subset of R n for some n. The de Rham cohomology groups (U are the cohomology groups
More informationAn algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization 5 (2008) 677 684 Contents lists available at ScienceDirect Discrete Optimization journal homepage: www.elsevier.com/locate/disopt An algorithm to increase the node-connectivity of
More informationFinding k disjoint paths in a directed planar graph
Finding k disjoint paths in a directed planar graph Alexander Schrijver CWI Kruislaan 413 1098 SJ Amsterdam The Netherlands and Department of Mathematics University of Amsterdam Plantage Muidergracht 24
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationThe intrinsic dimensionality of graphs
The intrinsic dimensionality of graphs Robert Krauthgamer James R. Lee June 16, 2006 Abstract We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica,
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationFine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
Mathematics Publications Mathematics 2017 Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles Zdeněk Dvořák Charles University Bernard Lidicky
More informationPreliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}
Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)
More informationThe Strong Largeur d Arborescence
The Strong Largeur d Arborescence Rik Steenkamp (5887321) November 12, 2013 Master Thesis Supervisor: prof.dr. Monique Laurent Local Supervisor: prof.dr. Alexander Schrijver KdV Institute for Mathematics
More informationExam 2 extra practice problems
Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either
More informationAntipodal Labelings for Cycles
Antipodal Labelings for Cycles Justie Su-Tzu Juan and Daphne Der-Fen Liu Submitted: December 2006; revised: August 2007 Abstract Let G be a graph with diameter d. An antipodal labeling of G is a function
More informationFast algorithms for even/odd minimum cuts and generalizations
Fast algorithms for even/odd minimum cuts and generalizations András A. Benczúr 1 and Ottilia Fülöp 2 {benczur,otti}@cs.elte.hu 1 Computer and Automation Institute, Hungarian Academy of Sciences, and Department
More informationPoorly embeddable metric spaces and Group Theory
Poorly embeddable metric spaces and Group Theory Mikhail Ostrovskii St. John s University Queens, New York City, NY e-mail: ostrovsm@stjohns.edu web page: http://facpub.stjohns.edu/ostrovsm March 2015,
More informationSome Sieving Algorithms for Lattice Problems
Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp - Some Sieving Algorithms for Lattice Problems V. Arvind and Pushkar
More informationVery few Moore Graphs
Very few Moore Graphs Anurag Bishnoi June 7, 0 Abstract We prove here a well known result in graph theory, originally proved by Hoffman and Singleton, that any non-trivial Moore graph of diameter is regular
More information