# 1 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal , AP, INDIA

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda , AP, INDIA Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal , AP, INDIA Abstract This paper considers a special case of the link distance where both point sets lie on the real line and the cost of matching two points is the distance between them in the L 1 metric. An O(n 2 ) algorithm for this problem is presented, improving the previous best known complexity of O(n 3 ). 1 Introduction Given two finite point sets S and T, let n = S + T. A linking between S and T is a matching, L, between the sets where all elements of S and T are matched to at least one element of the other set. The link distance between the two sets is defined as the minimumcost linking according to some distance function. This distance measure was originally proposed in 1997 by Eiter and Mannila [5] in the context of measuring the relationship between theories expressed in a logical language. Eiter and Mannila show that this problem can be solved in O(n 3 ) time via a reduction to the computation of a minimum-weight perfect matching in a suitable bipartite graph. The link distance can also be expressed as the minimum-weight bipartite edge cover problem. For a weighted bipartite graph G = (SUT, w, E), the edge cover problem asks a subset, E 1, of edges such that each vertex is the endpoint of at least one edge. The minimumweight edge cover problem finds the set E 1 of minimum weight. This problem may be solved in O(n 3 ) time using the Hungarian method [8]. Let D = (V,E) be a directed graph, and let V be partitioned into two disjoint sets, the source vertices S and the target vertices T. A bibranching in D with respect to S is a set of edges B in E such that: For each v in S, B contains a directed path from v to a vertex in T, and For each v in T, B contains a directed path from a vertex in S to v. For the special case when D is a bipartite graph with color classes S and T, and all the edges in D are directed from S to T, the bibranching is a bipartite edge cover. 1

2 In this note we address the special case where both point sets lie on the real line and the distance is measured with the L 1 metric. This version of the problem has applications to sequence comparison in bioinformatics as well as measuring music similarity in music information retrieval. Lemma 1.1. Let S and T be two sets of points, and L a minimum-cost linking between them. For s s 1 if(s, t) L, and (s 1, t) L then the distance from s to t is not more than the distance from s to any other element of T. Proof. Assume that for some minimum-cost linking L the above property does not hold. This implies that there is some s where (s, t) L such that (s, t) > (s, t 1 ) for some t 1 T, and there is s 1 s where (s 1, t) L. Consider L* L only in that s is linked to t 0 instead of t. Then the cost of L* is less than the cost of L, which contradicts the assumption that L is a minimum-cost linking. Lemma 1.2. Let S and T be two sets of points and L be a minimum-cost linking between them. Then, for any relation (s; t) L, either s or t has degree 1. Proof. Assume that there exists a minimum-cost linking L for which the Lemma does not hold. This implies that for some s; t where (s; t) L there exist s 1 ; t 1 where the relations (s; t 1 ) and (s 1 ; t) are also in L. But then we can construct a new linking L* L only in the exclusion of (s; t). L 1 is also a linking, since all elements are linked to at least one element of the other set; yet the cost of L* is less than cost of L, a contradiction. Eiter and Mannila proceed by constructing a bipartite graph in which the matching is performed. The key concept is the creation of dummy nodes to handle the case when an element, x, of either set is linked to an element of the other set which has degree more than one, and hence, by Lemma 1.1 is x s nearest neighbor in that set. From Lemma 1.2 we know that any such x must have degree one. Therefore we need only create one copy for each element of SUT with the weight of an edge between an element and its dummy node equal to the distance between that element and its nearest neighbor. The desired bipartite graph consists of two complete sub graphs; one representing the elements of S and T with weights equal to the distances between the elements; the other a complete zero-weight dummy subgraph. An element in the dummy subgraph is connected to its corresponding element in the first subgraph with a weight equal to the distance to that element s nearest neighbor. For sets S and T create a graph G = (AUB, E, w) in the following manner. For each s S create an a A, and for each t T create a b B. For each edge, e = (ai, bj), w(e) = (si, tj). Next, create a zero weight copy of the graph G 1 = (A 1 UB 1,E 1, w 1 ). 2

3 From these two graphs we construct a graph G 11 = G U G 1 and contains additional edges from ai to ai 1 and bj to bj 1 with weight equal to the minimum distance from si to an element of T and from t j to an element of S, respectively. Illustration 1: A graph corresponding to S = {2,6,7,8}, T = {1,3,7}. The minimum-weight perfect matching is given in bold. Figure 1: Lemma 1.3. w(m) = c(l) Proof. From a minimum-cost linking L, for every pairing (si, tj) L we perform one of three actions. If both si and tj have not yet been matched, then we add the edges (ai,bj) and (ai 1, bj1) to M. Otherwise, if si is already matched, we add (bj,bj 1 ) to the matching. Finally, if tj is already matched, we add (ai;ai 1 ) to the matching. Note that Lemma 2.2 cannot already have matched both s i and tj. Since each element si or tj is linked in L the corresponding nodes in G 11 must be matched. Therefore M is a matching. Furthermore, the weight of matching M* is equal to the cost of L because for the cost of each individual linking (si; tj) there is a corresponding matching in M* of equal weight. This follows from the definition of the weight function and Lemma 1.1. Thus w(m*) = c(l) establishing that w(m) c(l). From a minimum-weight matching M we construct a linking L*. For every matching m M if m = (ai,bj) we add (si, tj) to L. Otherwise, if m = (ai;ai 1 ) then we add a link between si and t T where t minimizes (si; t). Likewise for m = (bj,bj 1 ) we add a link between bj and an s S that minimizes (s,bj). This must be a linking since each element in S and T is represented by some ai or bj, which must occur in some matching. The weight of M is less than the cost of L because the cost of each link created is equal to the corresponding match by virtue of the manner in which the weight function is defined. We conclude that c(l) w(m). Thus, w(m) = c(l) 3

4 Letting n equal to S, Eiter and Mannila note that this reduction yields an O(n 3 ) time algorithm since the construction of the bipartite graph takes O(n 2 ) time, and finding a perfect matching in a complete bipartite graph takes O(n 3 ) time. 2 The Proposed O (n 2 ) Algorithm For two sets of points on the real line we can improve upon the previous O(n 3 ) algorithm by using the following simple Lemma, sometimes called the quadrangle Inequality [1]. Lemma 2.1. Let S and T be sets of points on the line. Also, let a distance function (s, t) = s-t. Then for a,b S where a < b, and c,d T where c < d, (a, c)+ (b,d) (a,d)+ (b, c) (1) Proof. Consider the following diagrams in Figure 2. Here, the dotted lines represent the smaller distance. Case 1 : a and b are both less than c or, symmetrically, greater than d Let x = a-b ; y = b-c and z = c-d. Then we have (a, c)+ (b,d) = x+2y+z = (a,d)+ (b, c). Case 2 : Either a or b, but not both, are in between c and d Let x = a-c ; y = c-b and z = b-d. Then, (a, c)+ (b,d) = x+z x+2y+z = (a,d)+ (b, c). Case 3 : Both a and b are in between c and d Let x = c-a ; y = a-b and z = b-d. Then, (a, c)+ (b,d) = x+z x+2y+z = (a,d)+ (b, c) 4

5 Corollary 2.2. Let S and T be sets of points on the real line. Then there exists a minimumcost linking L*: S T such that for all si < sj, L*(si) L*(sj). This observation implies that in a minimum-cost linking, if we know that (si, t j) L, then one of (si, tj+1), (si+1, t j), or (si+1, t j+1) must also be in L. Using this information it is not hard to reduce the problem to finding the shortest path through a weighted directed acyclic graph. The construction of this graph differs from the previous directed acyclic graph in that it is expanded to allow multiple linkings not only from elements of S to elements of T, but also from elements of T to elements of S. Let S and T be sets of integers on the interval (0;X). Let si denote the i th element of S. We construct a directed acyclic graph G in the following way. For all pairs of elements si, t j where si S and t j T construct a vertex vi, j. From each vertex vi, j add an edge to vi, j+1, vi+1, j, vi+1, j+1 with weights ti - sj+1, ti+1 - sj, ti+1 -sj+1, respectively, provided that each vertex exists. Finally create a vertex labeled start and insert an edge to v 1,1 with weight s 1-t 1. Illustration 2: A directed acyclic graph corresponding to the sets S = {2, 6, 7, 8}, T = {1, 3, 7}. The bold edges indicate the minimum-weight path through the graph. Figure 3: Lemma 2.3. w(p) = c(l) Proof. Consider a minimum-cost linking L on S and T. Then we can create a path P 1 from start to v T, S in G in the following way. First, the edge from start to v 1,1 is inserted. Next, for each (ti, sj) in L we know that one and only one of (ti, sj+1), (ti+1, sj), (ti+1, sj+1) is also in L. Therefore we add an edge from v i, j to whichever of the three that is in P 1. Since such an edge must exist in the graph, the path is connected. 5

6 Note that there is a one-to-one correspondence between edges and links, and by construction, each edge has the same weight, as it s corresponding link. Therefore we conclude that w(p 1 ) = c(l) and therefore, w(p) c(l). From a minimum-weight path P from start to v S, T in G, we create a linking, L 1, on the corresponding strings S and T. For any vertex v i, j through which P passes, add (si, tj) to L. This is a valid linking because there exist no paths in the graph that do not touch all rows and columns, and thus each node in SUT is included in some linking in L 1. Since the weight of each edge used is equal to the cost of the corresponding linking we conclude that w(p) = c(l 1 ), which yields w(p) c(l). Thus the desired result is w(p) = c(l). As for the complexity of this method, let S = n and T = m. In the construction V = O(n *m), and since there are at most three edges per node, E = O( V ). Thus the construction takes O( V ) = O(n*m) time. The algorithm for finding the shortest path between two elements in a directed acyclic graph takes time O( V + E ) which in this case is O( V ) = O(n *m) time [3]. Thus the total time complexity of the method is O(n *m) = O(n 2 ). References [1] Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, and Baruch Schieber. Efficient minimum cost matching and transportation using the quadrangle inequality. Journal of Algorithms, 19(1): , [2] J. Colannino and G. Toussaint. An algorithm for computing the restriction scaffold assignment problem in computational biology. Information Processing Letters, 95(Issue 4): , [3] Thomas C. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press (second edition), Cambridge Mass., [4] J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery, 19: , [5] Thomas Eiter and Heikki Mannila. Distance measures for point sets and their computation. Acta Informatica, 34(2): , [6] M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34: ,

7 [7] J. Keijsper and R. Pendavingh. An efficient algorithm for minimum-weight bibranching. Journal of Combinatorial Theory, 73(Series B): , [8] H.W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83 97, [9] A. Schrijver. Min-max relations for directed graphs. Annals of Discrete Mathematics, 16: , [10] N. Tomizawa. On some techniques useful for the solution of transportation network problems. Networks, 1: , [11] Godfried Toussaint. A comparison of rhythmic similarity measures. In Proc. 5th International Conference on Music Information Retrieval, pages ,

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### 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

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### THREE DIMENSIONAL GEOMETRY

Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

### Connected Identifying Codes for Sensor Network Monitoring

Connected Identifying Codes for Sensor Network Monitoring Niloofar Fazlollahi, David Starobinski and Ari Trachtenberg Dept. of Electrical and Computer Engineering Boston University, Boston, MA 02215 Email:

### Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design

Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design Hongsik Choi and Hyeong-Ah Choi Department of Electrical Engineering and Computer Science George Washington University Washington,

### Network (Tree) Topology Inference Based on Prüfer Sequence

Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### 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

### 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

### 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

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### 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.,

### 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 -

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Exact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem

xact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem Kanak Chandra Bora Department of Computer Science & ngineering Royal School of ngineering & Technology, Betkuchi, Guwahati-7810,

### Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

### Fundamentals of Media Theory

Fundamentals of Media Theory ergei Ovchinnikov Mathematics Department an Francisco tate University an Francisco, CA 94132 sergei@sfsu.edu Abstract Media theory is a new branch of discrete applied mathematics

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### Baltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions

Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.

### 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

### MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR 2006 24 April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### Offline 1-Minesweeper is NP-complete

Offline 1-Minesweeper is NP-complete James D. Fix Brandon McPhail May 24 Abstract We use Minesweeper to illustrate NP-completeness proofs, arguments that establish the hardness of solving certain problems.

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Mining Social Network Graphs

Mining Social Network Graphs Debapriyo Majumdar Data Mining Fall 2014 Indian Statistical Institute Kolkata November 13, 17, 2014 Social Network No introduc+on required Really? We s7ll need to understand

### Online EFFECTIVE AS OF JANUARY 2013

2013 A and C Session Start Dates (A-B Quarter Sequence*) 2013 B and D Session Start Dates (B-A Quarter Sequence*) Quarter 5 2012 1205A&C Begins November 5, 2012 1205A Ends December 9, 2012 Session Break

### OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION

OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering

### 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

### Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### 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

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

### 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

### ON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu

ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

### 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

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### 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

### Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Diversity Coloring for Distributed Data Storage in Networks 1

Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### Dynamic Programming. Applies when the following Principle of Optimality

Dynamic Programming Applies when the following Principle of Optimality holds: In an optimal sequence of decisions or choices, each subsequence must be optimal. Translation: There s a recursive solution.

### Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

### Approximating the Minimum Chain Completion problem

Approximating the Minimum Chain Completion problem Tomás Feder Heikki Mannila Evimaria Terzi Abstract A bipartite graph G = (U, V, E) is a chain graph [9] if there is a bijection π : {1,..., U } U such

### 5.1 Midsegment Theorem and Coordinate Proof

5.1 Midsegment Theorem and Coordinate Proof Obj.: Use properties of midsegments and write coordinate proofs. Key Vocabulary Midsegment of a triangle - A midsegment of a triangle is a segment that connects

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### 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

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### 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

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### CIRCLE COORDINATE GEOMETRY

CIRCLE COORDINATE GEOMETRY (EXAM QUESTIONS) Question 1 (**) A circle has equation x + y = 2x + 8 Determine the radius and the coordinates of the centre of the circle. r = 3, ( 1,0 ) Question 2 (**) A circle

### Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

### 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 }

### ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

### Semi-Matchings for Bipartite Graphs and Load Balancing

Semi-Matchings for Bipartite Graphs and Load Balancing Nicholas J. A. Harvey Richard E. Ladner László Lovász Tami Tamir Abstract We consider the problem of fairly matching the left-hand vertices of a bipartite

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### CMPS 102 Solutions to Homework 1

CMPS 0 Solutions to Homework Lindsay Brown, lbrown@soe.ucsc.edu September 9, 005 Problem..- p. 3 For inputs of size n insertion sort runs in 8n steps, while merge sort runs in 64n lg n steps. For which

### Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph

FPSAC 2009 DMTCS proc (subm), by the authors, 1 10 Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph Christopher R H Hanusa 1 and Thomas Zaslavsky 2 1 Department

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

### Minimize subject to. x S R

Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such

### Brendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235

139. Proc. 3rd Car. Conf. Comb. & Comp. pp. 139-143 SPANNING TREES IN RANDOM REGULAR GRAPHS Brendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235 Let n~ < n2

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs Leah Epstein Magnús M. Halldórsson Asaf Levin Hadas Shachnai Abstract Motivated by applications in batch scheduling of jobs in manufacturing

### 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].

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

### 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,

### 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

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### M.S. Ibrahim 1*, N. Maculan 2 and M. Minoux 3

Pesquisa Operacional (2014) 34(1): 117-124 2014 Brazilian Operations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/pope A NOTE ON THE NP-HARDNESS OF THE

### 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

### 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