COMPOSITION OF STABLE SET POLYHEDRA
|
|
- Ruth Hardy
- 6 years ago
- Views:
Transcription
1 COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining system of the stable set polytope for a graph with a ct-set of cardinality 2. We extend this reslt to ct-sets composed of a complete graph mins an edge and se the new theorem to derive a class of facets. 1 Preliminaries and Introdction Let G = (V, E) be a simple ndirected graph. A set S V of pairwise nonadjacent vertices defines a stable set. Let S := {S V S is a stable set}. Each S S has an incidence vector x S R V, where x S (v) = 1 if v S and x S (v) = 0 otherwise. Let P(G) be the convex hll of all x S sch that S S. P(G) is a fll-dimensional polytope and has a niqe (p to positive scalar mltiples) minimal defining system. Let V V and E(V ) := {v E, v V }. The sbgraph indced by V is G[V ] := (V, E(V )). For v V, define N G (v) := { V v E} and N G (v) := N G (v) {v}. A complete graph consists of pairwise adjacent vertices. A vertex set K V is complete whenever G[K] is a complete sbgraph. A maximal complete sbgraph defines a cliqe. A vertex v V is simplicial if G[N(v)] is complete. A ct-set C V decomposes G into a pair of proper sbgraphs (G 1, G 2 ) sch that C = V (G 1 ) V (G 2 ) and all paths from G 1 to G 2 intersect C. Chvátal [2] showed that the nion of defining systems of P(G 1 ) and P(G 2 ) defines P(G) when G[C] is a cliqe. Barahona and Mahjob [1] defined P(G) based on systems related to P(G 1 ) and P(G 2 ) when C 2. We extend this reslt to the case where G[C] is a complete graph mins an edge. Section 2 contains reslts necessary to extend Barahona and Mahjob s theorem. Section 3 generalizes their theorem. Section 3 refers to reslts from [1]. Section 4 applies the new theorem to derive a class of facets for the stable set polytope called diamonds. Section 5 smmarizes the reslts and discsses ftre research. bjm4@rice.ed, ivhicks@.rice.ed Department of Comptational and Applied Mathematics Rice University Hoston, 77005, USA. 1
2 v w 1 G k C\{,v} w 3 w 2 2 Spport Graphs Figre 1: The agmented graph G k. Sppose G has a ct-set C consisting of a nonadjacent pair of vertices. To obtain a defining system for P(G), Barahona and Mahjob [1] attach to C a new set of vertices {w i }. This agmentation defines a graph G. P( G) has a facet which projects along the sbspace of {w i } variables to define P(G). We generalize this method to the case where G[C] is a complete graph mins an edge. Section 3 analyzes the decomposition of G into the pair ( G 1, G 2 ). Here, we determine how the spport graphs of facets for P( G k ) interact with the {w i } vertices. Let a T x b be a nontrivial facet of P(G). Nontriviality implies b > 0 and a v 0 for all v V. In this section, all facets are assmed to be nontrivial. Define the following sets: V a := {v V a v > 0} and F a := {S S a T x S = b}. The spport graph of a T x b is defined as G a := G[V a ], the sbgraph indced by V a. Remark 1. Given a facet a T x b, F a consists of maximal stable sets in G a. In Section 3, we partition ineqalities based on their intersection with the set {w i }. Lemma 1 redces the nmber of partition sets. Recall that since P(G) is fll-dimensional, the sets S F a collectively satisfy no eqations other than scalar mltiples of a T x = b. Lemma 1. If a T x b is a non-cliqe facet, then G a contains no simplicial vertex. Proof. Sppose v V a is simplicial in G a. Then K := N Ga (v) is a cliqe and there exists an S F a sch that S K =. Otherwise, v K xs (v) = 1 for all S F a, a contradiction becase a T x b is not a cliqe ineqality. Observe that S is not a maximal stable set in G a, since S {v} is a feasible stable set. This contradicts Remark 1. Sppose G = (G 1, G 2 ) has a ct-set C where G[C] is a complete graph mins an edge. Notice G[C] has a stable set {, v}. For k {1, 2}, add the {w i } vertices to G k sch that N Gk (w 1 ) = {w 2 } (C \ {}), N Gk (w 2 ) = {w 1, }, and N Gk (w 3 ) = C. See Figre 1 for the agmented graph G k. The heavy edges denote joins (see [4]). For example, the edge between and C \ {, v} indicates that is adjacent to every vertex in C \ {, v}. Lemma 2. Let, v C be nonadjacent and C := C {w 1, w 2, w 3 }. For k {1, 2}, F k := {x P( G k ) z C x(z) = 2} is a facet for P( G k ). Moreover, no other facet contains all the vertices of C in its spport. 2
3 Proof. We show that F k is a facet for P( G k [ C]) by bilding a fll-rank C C matrix whose colmns are incidence vectors of all stable sets which lie on F k. See Figre 2. The first three rows correspond to w 1, w 2, and w 3. The last rows correspond to and C \ {}, respectively. Let 1 v be the ( C -1)-dimensional colmn vector with a 1 in row v and 0 s elsewhere. We now lift the ineqality z C x(z) 2 to a facet of P( G k ). Since all maximal stable sets J in G k satisfy J C = 2, the lifting coefficients for vertices in V ( G k ) \ C are zero. Ths, the ineqality is a facet of P( G k ). Sppose another facet a T x b contains all vertices of C in its spport. By Remark 1, z C xs (z) = 2 for all S F a. It follows that F k coincides with the face indced by a T x b. 1 0 T T T T I ( C 1) ( C 1) v Figre 2: The matrix A. Given a defining system for a polytope, the process of projecting along a sbspace of variables, say w 1 and w 2, is less complicated if the coefficients of w 1 and w 2 are binary. The following lemma allows the defining systems encontered in Section 3 to be pt in this form. Lemma 3 (Mahjob [3]). Given a facet a T x b, let w 1, w 2 V a be adjacent vertices in G a. If w 1 is simplicial in G a w 2 and w 2 is simplicial in G a w 1, then a w1 = a w2. Lemma 3 implies that a w1 = a w2 in any nontrivial facet containing both w 1 and w 2 in its spport. As a reslt, scaling these ineqalities by (1/a w1 ) = (1/a w2 ) will prodce ineqalities where both variables have binary coefficients. 3 Composition of Stable Set Polyhedra This section offers a straightforward extension of techniqes developed by Barahona and Mahjob. We will refer to reslts from [1]. Let G = (G 1, G 2 ) have a ct-set C where G[C] is a complete graph mins an edge. Constrct the agmented graph G by adding a new set of vertices {w i } to C, as in Section 2. Define C := C {w i }. P( G) has a facet F = {x P( G) z C x(z) = 2} sch that P(G) = proj w1,w 2,w 3 {F } = {x R G w R 3 s.t. (x, w) F }. The set C decomposes G into the pair ( G 1, G 2 ). In Section 2, it was shown that P( G k ) has a facet F k for k {1, 2}. 3
4 Lemma 4 (Barahona and Mahjob [1]). The facet F is defined by the nion of the systems that define F 1 and F 2. Lemma 4 relies on the existence of a fll-rank, sqare matrix of all incidence vectors for stable sets on F, F 1, and F 2. The matrix A constrcted in the proof of Lemma 2 (see Figre 2) implies that this lemma holds for the class of ct-sets C we are analyzing. In order to find a defining system for F, consider the defining system for P( G k ) (other than cliqe ineqalities involving the {w i } variables). Recall from Section 2 that the spport of a T x b is denoted by V a. Lemma 1 and Lemma 2 imply that the facet-defining ineqalities can be partitioned into three sets I k 1, I k 2,I k 3 defined as follows: I k 1 := {a T i x b i V ai {w 1, w 2, w 3 } = } I k 2 := {at i x b i V ai {w 1, w 2, w 3 } = {w 1, w 2 }} I k 3 := {at i x b i V ai {w 1, w 2, w 3 } = {w 3 }}. Let V k = V (G k ). Lemma 3 and Lemma 4 imply that the defining system of F can be written as follows, k {1, 2}: 1. j V k a k ij x(j) bk i, for all i Ik 1 2. j V k a k ij x(j) + x(w 1) + x(w 2 ) b k i, for all i Ik 2 3. j V k a k ij x(j) + x(w 3) b k i, for all i Ik 3 4. j C\ x(j) + x(w 1) 1 5. j C\ x(j) + x(w 3) 1 6. j C\v x(j) + x(w 3) 1 7. x() + x(w 2 ) 1 8. x(w 1 ) + x(w 2 ) 1 9. j C x(j) = x(j) 0, for all j Ṽk. The projection of this system along the sbspace of the {w i } variables is the polytope P(G). To define P(G), we proceed exactly as in [1]. Theorem 1. The polytope P(G) is defined by the nion of defining systems for P(G 1 ) and P(G 2 ), the non-negativity constraints, and the following facet-defining mixed ineqalities: a k ij x(j) + a l rj x(j) x(j) b k i + bl r 2 for k = 1, 2; l = 1, 2; k l; i Ik 2 ; r Il 3. j V k j V l j C Proof. See Theorem 3.5 and Corollary 3.7 in [1]. 4
5 4 Diamonds This section ses Theorem 1 to derive a class of facets for P(G). Let K 1,..., K 6 be sets of vertices sch that each K i is nonempty and complete. The graph G shown in Figre 3 is a member of a class of graphs which we call diamonds. The heavy edges denote joins. For example, an edge between K i and K j indicates that G[K i K j ] is complete. The size of the diamond is eqal to the nmber of sets K i. The diamond in Figre 3 has size 6, and z V x(z) 3 indces a facet for P(G). In general, facet-indcing diamonds have size 2n (where n > 1), a vertex sch that N G () = 2n i=1 K i, and a path P = p 1 p 2...p 2n 2 attached to the sets K 1,..., K 2n as shown in Figre 3. p 1 p 2 p 3 p 4 K 1 K 2 K 3 K 4 K 5 K 6 Figre 3: A diamond of size 6. Theorem 2. Let n > 1. If a diamond G has size 2n, then z V x(z) n indces a facet for P(G). Proof. The proof is by indction on n. Base case (n = 2): Choose v K 1 and w K 4. The diamond of size 4 has a 5-hole on the vertex set {p 1, p 2, w,, v}. Moreover, the odd-hole ineqality can be lifted to inclde all vertices in 4 i=1 K i. This implies that z V x(z) 2 indces a facet for P(G) as claimed. Indction step (n > 2): Sppose the theorem holds for all diamonds of even size less than 2n. The diamond of size 2n has a ct-set C = K 2n 3 {, p 2n 4 } which can be constrcted by removing an edge from a complete graph. Therefore, we apply Theorem 1. Figre 4 shows sbgraphs of the pair ( G 1, G 2 ). Let V 1 = V ( G 1 ) \ {w 1, w 2 } and V V ( G 2 ) \ {w 3 }. The graph on the left is a diamond of size 2n 2. By indction, 2 = x(z) n 1 (1) z V 1 is a facet for P( G 1 ). G2 has an odd-hole ineqality which lifts to obtain that x(z) 3 (2) z V 2 is a facet for P( G 2 ). Notice that ineqality (1) I3 1 and ineqality (2) I2 2. Theorem 1 gives the following facet-defining mixed ineqality for P(G) : x(z) + x(z) n z V (G 1 ) z V (G 2 )x(z) z C 5
6 p 1... p 2n-4 p 2n-4 p 2n-3 p 2n-2 K 1 K 2... K 2n-3 w 3 w 1 K 2n-3 K 2n-2 K 2n-1 K 2n w 2 Figre 4: Sbgraphs of G 1 and G 2. Upon simplifying, we obtain that z V x(z) n is a facet for P(G) as claimed. Theorem 2 fails when the diamond has size that is odd and at least three. To see this, let G be the diamond of size 3 shown in Figre 5. G is perfect and not a cliqe, so G is not a spport graph for any facet of P(G). Now let G be the diamond of size 5 also shown in Figre 5. If G is the spport graph of a facet, then there mst exist i=1 K i affinely independent maximal stable sets satisfying some eqation. However, no sch set exists. It follows by indction that a diamond of odd size is not a spport graph for any facet of P(G). 5 Conclsions and Ftre Work This paper generalized a theorem of Barahona and Mahjob concerning the composition of stable set polyhedra. The new reslt was applied to derive a class of facets called diamonds. Ftre research incldes sing composition to derive other classes of facets. An extension of Theorem 1 to more general ct-sets wold also be beneficial since composition can be applied recrsively. In other words, G can be decomposed into sbgraphs G 1,..., G m sch that the defining system for each P(G i ) is known. For example, decompose G into a set of perfect graphs. The defining systems for each P(G i ) can then be composed to define P(G). Another idea is to constrct P(G) starting from the leaves of a tree or branch decomposition. These approaches have the potential to characterize the stable set polytope for graphs which admit a strctred decomposition, bt they reqire a more general form of Theorem 1. Generalizing Theorem 1 might reqire techniqes different from the lift and project method of Barahona and Mahjob. Finding a G k and F k with the correct strctre ap- p p 1 p 2 p 3 K 1 K 2 K 3 K 4 K 5 Figre 5: Diamonds with odd size. 6
7 pears to be difficlt. A sbtle reqirement is that G k [ C] has to have exactly C affinely independent maximm stable sets. Otherwise, the matrix A is not invertible and Lemma 4 fails. Withot this restriction, Theorem 1 wold have held for any ct-set which partitions into two cliqes. There exist many graphs G k [ C] with exactly C affinely independent maximm stable sets, bt the ineqalities which define F k mst also involve the w i vertices in a strctred way. This strctre wold most likely involve extending the reslts of Section 2 to prevent the projection step from becoming too complicated. 6 Acknowledgements The athors wold like to thank the referee for comments which helped improve the presentation of this paper. This research was partially spported by NSF grants DMI and DMS References [1] F. Barahona and A.R. Mahjob, Compositions of Graphs and Polyhedra II: Stable Sets, SIAM J. Discrete Math., 7 (1994), pp [2] V. Chvátal, On Certain Polytopes Associated with Graphs, Jornal of Combinatorial Theory (B), 18 (1975), pp [3] A. R. Mahjob, On the Stable Set Polytope of a Series-Parallel Graph, Mathematical Programming, 40 (1988), pp [4] D. West, Introdction to Graph Theory, Prentice Hall, New York,
h-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationFinite Domain Cuts for Minimum Bandwidth
Finite Domain Cts for Minimm Bandwidth J. N. Hooker Carnegie Mellon University, USA Joint work with Alexandre Friere, Cid de Soza State University of Campinas, Brazil INFORMS 2013 Two Related Problems
More informationMTL 776: Graph Algorithms. B S Panda MZ 194
MTL 776: Graph Algorithms B S Panda MZ 194 bspanda@maths.iitd.ac.in bspanda1@gmail.com Lectre-1: Plan Definitions Types Terminology Sb-graphs Special types of Graphs Representations Graph Isomorphism Definitions
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationLemma 1 Let the components of, Suppose. Trees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic). (b)
Trees Lemma Let the components of ppose "! be (a) $&%('*)+ - )+ / A tree is a graph which is (b) 0 %(')+ - 3)+ / 6 (a) (a) Connected and (b) has no cycles (acyclic) (b) roof Eery path 8 in which is not
More informationarxiv: v3 [math.co] 7 Sep 2018
Cts in matchings of 3-connected cbic graphs Kolja Knaer Petr Valicov arxiv:1712.06143v3 [math.co] 7 Sep 2018 September 10, 2018 Abstract We discss conjectres on Hamiltonicity in cbic graphs (Tait, Barnette,
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationThe Domination and Competition Graphs of a Tournament. University of Colorado at Denver, Denver, CO K. Brooks Reid 3
The omination and Competition Graphs of a Tornament avid C. Fisher, J. Richard Lndgren 1, Sarah K. Merz University of Colorado at enver, enver, CO 817 K. rooks Reid California State University, San Marcos,
More informationIntroduction to Computational Manifolds and Applications
IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationGraceful Labeling for Double Step Grid Graph
International Jornal of Mathematics And its Applications Volme 3, Isse 1 (015), 33 38. ISSN: 347-1557 International Jornal 347-1557 of Mathematics Applications And its ISSN: Gracefl Labeling for Doble
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationMinimum Spanning Trees Outline: MST
Minimm Spanning Trees Otline: MST Minimm Spanning Tree Generic MST Algorithm Krskal s Algorithm (Edge Based) Prim s Algorithm (Vertex Based) Spanning Tree A spanning tree of G is a sbgraph which is tree
More informationOn Plane Constrained Bounded-Degree Spanners
Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationarxiv: v1 [cs.cg] 27 Nov 2015
On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More informationRepresenting a Cubic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions
Representing a Cbic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions ABSTRACT Abhijin Adiga Network Dynamics and Simlation Science Laboratory Virginia Bioinformatics Institte,
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationReconstructing Generalized Staircase Polygons with Uniform Step Length
Jornal of Graph Algorithms and Applications http://jgaa.info/ ol. 22, no. 3, pp. 431 459 (2018) DOI: 10.7155/jgaa.00466 Reconstrcting Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinaa
More informationOn shortest-path all-optical networks without wavelength conversion requirements
Research Collection Working Paper On shortest-path all-optical networks withot waelength conersion reqirements Athor(s): Erlebach, Thomas; Stefanakos, Stamatis Pblication Date: 2002 Permanent Link: https://doi.org/10.3929/ethz-a-004446054
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationarxiv: v1 [cs.dm] 30 Apr 2014
The stable set polytope of (P 6,triangle)-free graphs and new facet-inducing graphs Raffaele Mosca arxiv:1404.7623v1 [cs.dm] 30 Apr 2014 May 1, 2014 Abstract The stable set polytope of a graph G, denoted
More informationPage 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. Greedy Algorithms and Graph Optimization Problems
CSCE J Data Strctres & Algorithms Greedy Algorithms and Graph Optimization Problems Dr. Steve Goddard goddard@cse.nl.ed http://www.cse.nl.ed/~goddard/corses/cscej CSCE J Data Strctres & Algorithms Giving
More informationTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,
More informationOn Plane Constrained Bounded-Degree Spanners
On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,
More information(2, 4) Tree Example (2, 4) Tree: Insertion
Presentation for se with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 B-Trees and External Memory (2, 4) Trees Each internal node has 2 to 4 children:
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationTriple Connected Complementary Tree Domination Number of a Graph
International Mathematical Form, Vol. 8, 2013, no. 14, 659-670 HIKARI Ltd, www.m-hikari.com Triple Connected Complementar Tree Domination Nmber of a Graph G. Mahadevan 1, Selvam Avadaappan 2, N. Ramesh
More informationOn a Cardinality-Constrained Transportation Problem With Market Choice
On a Cardinality-Constrained Transportation Problem With Market Choice Matthias Walter a, Pelin Damcı-Kurt b, Santanu S. Dey c,, Simge Küçükyavuz b a Institut für Mathematische Optimierung, Otto-von-Guericke-Universität
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationIdentification of the Symmetries of Linear Systems with Polytopic Constraints
2014 American Control Conference (ACC) Jne 4-6, 2014. Portland, Oregon, USA Identification of the Symmetries of Linear Systems with Polytopic Constraints Clas Danielson and Francesco Borrelli Abstract
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationOn Bichromatic Triangle Game
On Bichromatic Triangle Game Gordana Manić Daniel M. Martin Miloš Stojakoić Agst 16, 2012 Abstract We stdy a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationConstructing Multiple Light Multicast Trees in WDM Optical Networks
Constrcting Mltiple Light Mlticast Trees in WDM Optical Networks Weifa Liang Department of Compter Science Astralian National University Canberra ACT 0200 Astralia wliang@csaneda Abstract Mlticast roting
More informationEdge Guards for Polyhedra in Three-Space
Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationTutte Embeddings of Planar Graphs
Spectral Graph Theory and its Applications Lectre 21 Ttte Embeddings o Planar Graphs Lectrer: Daniel A. Spielman November 30, 2004 21.1 Ttte s Theorem We sally think o graphs as being speciied by vertices
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationDirac-type characterizations of graphs without long chordless cycles
Dirac-type characterizations of graphs without long chordless cycles Vašek Chvátal Department of Computer Science Rutgers University chvatal@cs.rutgers.edu Irena Rusu LIFO Université de Orléans irusu@lifo.univ-orleans.fr
More informationNew Architectures for Hierarchical Predictive Control
Preprint, 11th IFAC Symposim on Dynamics and Control of Process Systems, inclding Biosystems Jne 6-8, 216. NTNU, Trondheim, Norway New Architectres for Hierarchical Predictive Control Victor M. Zavala
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationTopological Drawings of Complete Bipartite Graphs
Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented
More informationCharacterization of Graphs with Eulerian Circuits
Eulerian Circuits 3. 73 Characterization of Graphs with Eulerian Circuits There is a simple way to determine if a graph has an Eulerian circuit. Theorems 3.. and 3..2: Let G be a pseudograph that is connected
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationTrail Making Game. Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, , Republic of Korea.
Trail Making Game Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea. May 7, 2009 Abstract Trail Making is a game played on a graph with
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationEulerian subgraphs containing given edges
Discrete Mathematics 230 (2001) 63 69 www.elsevier.com/locate/disc Eulerian subgraphs containing given edges Hong-Jian Lai Department of Mathematics, West Virginia University, P.O. Box. 6310, Morgantown,
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More informationImproving Network Connectivity Using Trusted Nodes and Edges
Improing Network Connectiity Using Trsted Nodes and Edges Waseem Abbas, Aron Laszka, Yegeniy Vorobeychik, and Xenofon Kotsokos Abstract Network connectiity is a primary attribte and a characteristic phenomenon
More informationSimplicial Trees are Sequentially Cohen-Macaulay
Simplicial Trees are Seqentiall Cohen-Macala Sara Faridi Agst 27, 2003 Abstract This paper ses dalities between facet ideal theor and Stanle-Reisner theor to show that the facet ideal of a simplicial tree
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationPlanarity-Preserving Clustering and Embedding for Large Planar Graphs
Planarity-Presering Clstering and Embedding for Large Planar Graphs Christian A. Dncan, Michael T. Goodrich, and Stephen G. Koboro Center for Geometric Compting The Johns Hopkins Uniersity Baltimore, MD
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationif for every induced subgraph H of G the chromatic number of H is equal to the largest size of a clique in H. The triangulated graphs constitute a wid
Slightly Triangulated Graphs Are Perfect Frederic Maire e-mail : frm@ccr.jussieu.fr Case 189 Equipe Combinatoire Universite Paris 6, France December 21, 1995 Abstract A graph is triangulated if it has
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More information10.2 Solving Quadratic Equations by Completing the Square
. Solving Qadratic Eqations b Completing the Sqare Consider the eqation We can see clearl that the soltions are However, What if the eqation was given to s in standard form, that is 6 How wold we go abot
More informationOn total regularity of the join of two interval valued fuzzy graphs
International Jornal of Scientific and Research Pblications, Volme 6, Isse 12, December 2016 45 On total reglarity of the join of two interval valed fzzy graphs Soriar Sebastian 1 and Ann Mary Philip 2
More informationCohesive Subgraph Mining on Attributed Graph
Cohesive Sbgraph Mining on Attribted Graph Fan Zhang, Ying Zhang, L Qin, Wenjie Zhang, Xemin Lin QCIS, University of Technology, Sydney, University of New Soth Wales fanzhang.cs@gmail.com, {Ying.Zhang,
More informationSubmodule construction for systems of I/O automata*
Sbmodle constrction for systems of I/O atomata* J. Drissi 1, G. v. Bochmann 2 1 Dept. d'iro, Université de Montréal, CP. 6128, Scc. Centre-Ville, Montréal, H3C 3J7, Canada, Phone: (514) 343-6161, Fax:
More informationComputing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3
Compting the weights of criteria with interval-valed fzzy sets for MCDM problems Chen-ng Chen Kan-Hng in 2 Hi-ing Cheng 3 Department of Information Management National nited niversity aiwan 2 Specialist
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More informationSubgraph Matching with Set Similarity in a Large Graph Database
1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,
More informationNon-convex Representations of Graphs
Non-conex Representations of Graphs Giseppe Di Battista, Fabrizio Frati, and Marizio Patrignani Dip. di Informatica e Atomazione Roma Tre Uniersity Abstract. We sho that eery plane graph admits a planar
More informationAMS : Combinatorial Optimization Homework Problems - Week V
AMS 553.766: Combinatorial Optimization Homework Problems - Week V For the following problems, A R m n will be m n matrices, and b R m. An affine subspace is the set of solutions to a a system of linear
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationToday. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling
Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationarxiv: v1 [cs.dm] 21 Dec 2015
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs Arman Boyacı 1, Tinaz Ekim 1, and Mordechai Shalom 1 Department of Industrial Engineering, Boğaziçi University, Istanbul, Turkey
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationOn the number of distinct directions of planes determined by n points in R 3
On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines
More informationarxiv: v1 [cs.cg] 1 Feb 2016
The Price of Order Prosenjit Bose Pat Morin André van Renssen, arxiv:160.00399v1 [cs.cg] 1 Feb 016 Abstract We present tight bonds on the spanning ratio of a large family of ordered θ-graphs. A θ-graph
More informationA NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL
A NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL KIM KESTING, JAMES POZZI, AND JANET STRIULI Abstract. An algebraic approach to graph theory involves the study of the edge ideal and
More informationCrossing Families. Abstract
Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More informationThe Strong Colors of Flowers The Structure of Graphs with chordal Squares
Fakltät für Mathematik, Informatik nd Natrissenschaften der Rheinisch-Westfälischen Technischen Hochschle Aachen arxiv:1711.03464v1 [math.co] 9 Nov 2017 Master Thesis The Strong Colors of Floers The Strctre
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationv e v 1 C 2 b) Completely assigned T v a) Partially assigned Tv e T v 2 p k
Approximation Algorithms for a Capacitated Network Design Problem R. Hassin 1? and R. Rai 2?? and F. S. Salman 3??? 1 Department of Statistics and Operations Research, Tel-Ai Uniersity, Tel Ai 69978, Israel.
More informationLATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS
LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More information