(Nearly)-tight bounds on the linearity and contiguity of cographs
|
|
- Dwayne Leonard
- 5 years ago
- Views:
Transcription
1 Bordeaux Graph Workshop 21/11/ Bordeaux (Nearly)-tight bounds on the linearity and contiguity of cographs Christophe Crespelle LI Université de Lyon INRIA hilippe Gambette LIGM Université aris-est Marne-la-Vallée
2 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
3 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
4 Contiguity a graph G a b c f h d e g a closed-k-interval model of G a d b c e f h g order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
5 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ N[a]: a d b c e f h g closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
6 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g N[a]: k 2 closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
7 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g N[b]: k 2 closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
8 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g N[c]: k 2 closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
9 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ... a d b c e f h g k = 2 cc(g) 2 closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
10 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ... a d b c e f h g k = 2 cc(g) 2 A min-max parameter: cc(g) = min max cc G,σ (v) σ v closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model
11 Contiguity a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ... a d b c e f h g k = 2 cc(g) 2 A min-max parameter: cc(g) = min max cc G,σ (v) σ v closed contiguity of G, cc(g): smallest k / G has a closed-k-interval model compact representation of G
12 Contiguity and consecutives ones a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g a d b c e f h g adjacency matrix A of G G has closed contiguity k if the lines and columns of the adjacency matric A of G can be reordered so that they contain at most k blocks of consecutives ones.
13 Contiguity and consecutives ones a graph G a b c f h d e g a closed-k-interval model of G order σ where the closed neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g a d b c e f h g cc(g) 2 G has closed contiguity k if the lines and columns of the adjacency matric A of G can be reordered so that they contain at most k blocks of consecutives ones.
14 Contiguity a graph G a b c f h d e g an open-k-interval model of G order σ where the open neighborhood of each vertex is the union of at most k intervals of σ a d b c e f h g N(a): k 2 open contiguity of G, oc(g): smallest k / G has an open-k-interval model
15 Contiguity a graph G a b c f h d e g an open-k-interval model of G order σ where the open neighborhood of each vertex is the union of at most k intervals of σ N(h): a d b c e f h g k 3 oc(g) 3 open contiguity of G, oc(g): smallest k / G has an open-k-interval model
16 Contiguity a graph G a b c f h d e g an open-k-interval model of G order σ where the open neighborhood of each vertex is the union of at most k intervals of σ N(h): a d b c e f h g k 3 oc(g) 3 Remark: oc(g) cc(g)+1 ; cc(g) oc(g)+1 open contiguity of G, oc(g): smallest k / G has an open-k-interval model
17 Linearity a graph G a b c f h d e g a closed-k-line model of G k orders where the closed neighborhood of each vertex is the union of one interval per order N[a]: a d b c e f h g k 2 a d b c e f g h closed linearity of G, cl(g): smallest k / G has a closed-k-line model
18 Linearity a graph G a b c f h d e g an open-k-line model of G k orders where the open neighborhood of each vertex is the union of one interval per order N(h): a d b c e f h g k 2 a d b c e f g h open linearity of G, ol(g): smallest k / G has an open-k-line model
19 Linearity a graph G a b c f h d e g an open-k-line model of G k orders where the open neighborhood of each vertex is the union of one interval per order N(h): a d b c e f h g k 2 a d b c e f g h Remark: ol(g) cl(g)+1 ; cl(g) ol(g)+1 cl(g) cc(g) (replicate same order) open linearity of G, ol(g): smallest k / G has an open-k-line model
20 Computing the contiguity/linearity cc(g) = 1 cl(g) = 1 G unit interval graph oc(g) = 1 ol(g) = 1 G biconvex graph Given a fixed k 2, cc(g) = k? oc(g) = k? N-complete Wang, Lau & Zhao, DAM, 2007 Bounds: For any graph G, cl(g) cc(g) n/4+o( n log n ) Gavoille & eleg, SIAM JoDM, 1999 There exist interval graphs and permutation graphs with n vertices and with closed contiguity at least O(log n) / closed linearity at least O(log n / log log n) Crespelle & Gambette, IWOCA 2009
21 Computing the contiguity/linearity cc(g) = 1 cl(g) = 1 G unit interval graph oc(g) = 1 ol(g) = 1 G biconvex graph Given a fixed k 2, cc(g) = k? oc(g) = k? N-complete Wang, Lau & Zhao, DAM, 2007 Bounds: For any graph G, cl(g) cc(g) n/4+o( n log n ) Gavoille & eleg, SIAM JoDM, 1999 There exist interval graphs and permutation graphs with n vertices and with closed contiguity at least O(log n) / closed linearity at least O(log n / log log n) Crespelle & Gambette, IWOCA 2009 upper bound?
22 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
23 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T T b c G a b c a Two vertices adjacent in G iff their lowest common ancestor in T is a series node
24 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T T S c d b G a b c d a Two vertices adjacent in G iff their lowest common ancestor in T is a series node
25 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T d c T S S a b G a b c d e f g e g f Two vertices adjacent in G iff their lowest common ancestor in T is a series node
26 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T d r c S T G b S S a h a b c d e f g h e g f Two vertices adjacent in G iff their lowest common ancestor in T is a series node
27 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T d r c S T G b S S a h a b c d e f g h Useful properties: e g f Complement: For any graph G, cc(g) cc(g)+1 Series & parallel operation: For any graphs G and H, cc(s(g,h) max(cc(g),cc(h))+1, cc(p(g,h) max(cc(g),cc(h)) cl(s(g,h) max(cl(g),cl(h))+1, cl(p(g,h) max(cl(g),cl(h))
28 Cographs cograph G = graph without induced 4 graph built by series composition (series operation) and disjoint union (parallel operation) cotree T d r c S T G b S S a h a b c d e f g h Useful properties: e g f Complement: For any graph G, cc(g) cc(g)+1 Series & parallel operation: For any graphs G and H, cc(s(g,h) max(cc(g),cc(h))+1, cc(p(g,h) max(cc(g),cc(h)) cl(s(g,h) max(cl(g),cl(h))+1, cl(p(g,h) max(cl(g),cl(h))
29 Contiguity of cographs Useful properties: Complement: For any graph G, cc(g) cc(g)+1 Series & parallel operation: For any graphs G and H, cc(s(g,h) max(cc(g),cc(h))+1, cc(p(g,h) max(cc(g),cc(h)) cl(s(g,h) max(cl(g),cl(h))+1, cl(p(g,h) max(cl(g),cl(h)) cc(g) height(t) Cograph with caterpillar cotree: cc(g) 2 T S S r σ = d h a b c e f g a b c d e f g h
30 Contiguity of cographs Useful properties: Complement: For any graph G, cc(g) cc(g)+1 Series & parallel operation: For any graphs G and H, cc(s(g,h) max(cc(g),cc(h))+1, cc(p(g,h) max(cc(g),cc(h)) cl(s(g,h) max(cl(g),cl(h))+1, cl(p(g,h) max(cl(g),cl(h)) cc(g) height(t) Cograph with caterpillar cotree: cc(g) 2 T S S r σ = d h a b c e f g Combine both to get an upper bound for general cographs? a b c d e f g h
31 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
32 Rank of a tree rank(t) = maximal height of a complete binary tree T' obtained from T by edge contractions T
33 Rank of a tree rank(t) = maximal height of a complete binary tree T' obtained from T by edge contractions T T' rank(t)=2
34 Rank and path partition of a tree For any rooted tree T, rank(t) = maximum height of its path partitions A path partition { 1, 2, 3, 4, 5, 6 } of T A path partition tree of T T height
35 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
36 Upper bound on the contiguity / linearity For a cograph G and its cotree T, cc(g) 2 rank(t) (log n) Idea of the proof: Consider a root-path decomposition of T i [1..p], rank(t i ) +1 rank(t) S T S T p-4 S T p-3 T p-2 T p-1 T p T 6 T 1 T 2 T 4 T 3 T 5
37 Upper bound on the contiguity / linearity For a cograph G and its cotree T, cc(g) 2 rank(t) (log n) Idea of the proof: Consider a root-path decomposition of T i [1..p], rank(t i ) +1 rank(t) S T S T p-4 S T p-3 T p-2 T p-1 T p T 6 T 1 T 2 T 4 T 3 T 5 2 X 1 X 2 X 3 X 6 X p-2 X p-1 X 4 X 5 X p-4 X p Build the order cc(g) 2 + max cc(g[x i ]) i [1..p] X p-3
38 Upper bound on the contiguity / linearity For a cograph G and its cotree T, cc(g) 2 rank(t) (log n) Idea of the proof: Consider a root-path decomposition of T i [1..p], rank(t i ) +1 rank(t) S T S T p-4 S T p-3 T p-2 T p-1 T p T 6 T 1 T 2 T 4 T 3 T X 1 X 2 X 3 X 6 X p-2 X p-1 X 4 X 5 X p-4 X p Build the order cc(g) 2 + max cc(g[x i ]) i [1..p] Refine the order by recursively treating each T i X p-3
39 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
40 Lower bound on the contiguity For a cograph G with complete binary cotree, cc(g) ((log n)-5)/4 Idea of the proof: Base case: Induction: Vertices x y & t all need to be adjacent to z in σ so that their neighborhood is one interval cc(k 1,3 ) 2 4(k+1) T S u S u 1 u 2 S r t claw K 1,3 z x y x y t z v S cotree(k 1,3 ) 4k v 1 v S S 2 v 3 S S Tv T T v3 1 v 2 X 1 x X 2 y X 3 t z
41 Lower bound on the linearity For a cograph G with complete binary cotree, cl(g) O((log n)/(log log n)) Idea of the proof: Base case is star K 1,2k+1 (bigger than K 1,3 ) need a bigger complete binary cotree, of height 2k log(2k+1) +1
42 Tightness of the bounds For a cograph G with complete binary cotree, cc(g) = (log n)/2 +1 Idea of the proof: Oreste Manoussakis, 2012 Careful analysis of the result of the root-path decomposition algorithm for the upper bound. Analysis based on C 4 -cycles for the lower bound. Linearity open: O(log n) or O((log n)/(log log n))?
43 Tightness of the bounds Idea of the proof: For any cograph G, there is a linear time constant-factor approximation algorithm to compute its contiguity. Crespelle & Gambette, WALCOM 2013 Approximate value given by the root-path decomposition algorithm. Lower and upper bounds on the contiguity depending on the height of the biggest complete binary tree which is a minor of the cotree T of G, i.e. the rank of T: cc(g) 2 rank(t) + 1 cc(g) (rank(t) 7) / 4 approximation ratio 23
44 Outline Contiguity and linearity Cographs and cotrees A min-max theorem on the rank of a tree Upper bounds with caterpillar decompositions Lower bounds with claws erspectives
45 erspectives Open problems Linearity of cographs? Gap between linearity and contiguity? Linearity or contiguity of graphs classes generalizing cographs ractical applications of linearity and contiguity practical approaches to get upper bounds? use in algorithmic contexts? Solving problems on graphs with bounded linearity or contiguity. use for some graph classes arising from applications: express a complexity value for phylogenetic networks (min. spread) Asano, Jansson, Sadakane, Uehara & Valiente, 2010
46 Thank you for your attention Any questions? Work partially supported by the ES-C1 project Christophe Crespelle & hilippe Gambette (2009), Efficient Neighbourhood Encoding for Interval Graphs and ermutation Graphs and O(n) Breadth-First Search, IWOCA'09, LNCS 5874, p Christophe Crespelle & hilippe Gambette (2013), Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs, WALCOM'13, LNCS, to appear.
Cographs; 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 informationA multivariate interlace polynomial
A multivariate interlace polynomial Bruno Courcelle LaBRI, Université Bordeaux 1 and CNRS General objectives : Logical descriptions of graph polynomials Application to their computations Systematic construction
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
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 informationSuccinct Data Structures for the Range Minimum Query Problems
Succinct Data Structures for the Range Minimum Query Problems S. Srinivasa Rao Seoul National University Joint work with Gerth Brodal, Pooya Davoodi, Mordecai Golin, Roberto Grossi John Iacono, Danny Kryzanc,
More informationDefinitions Results. Polar cographs 1 IMA-ROSE. Ecole Polytechnique Fédérale de Lausanne, Switzerland
Polar cographs Tınaz Ekim 1 N.V.R. Mahadev 2 Dominique de Werra 1 1 IMA-ROSE Ecole Polytechnique Fédérale de Lausanne, Switzerland tinaz.ekim@epfl.ch, dewerra.ima@epfl.ch 2 Fitchburg State College, USA
More informationDominating Set Counting in Graph Classes
Dominating Set Counting in Graph Classes Shuji Kijima 1, Yoshio Okamoto 2, and Takeaki Uno 3 1 Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan kijima@inf.kyushu-u.ac.jp
More informationand e 2 ~ e 2 iff e 1
Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x
More informationA Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus
A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus Timothy A. D. Fowler Department of Computer Science University of Toronto 10 King s College Rd., Toronto, ON, M5S 3G4, Canada
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationf 0 (a,b,c,w,x,y,z) = ay cxy bw bz is a read-once function since it can be factored into the expression
Chapter 10 Read-once functions Martin C. Golumbic and Vladimir Gurvich 10.1 Introduction In this chapter, we present the theory and applications of read-once Boolean functions, one of the most interesting
More informationRank and Select Operations on Binary Strings (1974; Elias)
Rank and Select Operations on Binary Strings (1974; Elias) Naila Rahman, University of Leicester, www.cs.le.ac.uk/ nyr1 Rajeev Raman, University of Leicester, www.cs.le.ac.uk/ rraman entry editor: Paolo
More informationCSCE 750 Final Exam Answer Key Wednesday December 7, 2005
CSCE 750 Final Exam Answer Key Wednesday December 7, 2005 Do all problems. Put your answers on blank paper or in a test booklet. There are 00 points total in the exam. You have 80 minutes. Please note
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationMechanical Engineering. UCSB
Monday, August 20, 2007 Can change this on the Master Slide 1 A toolbox for computing spectral properties of dynamical systems N. Govindarajan, R. Mohr, S. Chandrasekaran, I. Mezić SIAM DS17 May 23, 2017
More informationHarvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries
Harvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries Harry Lewis September 5, 2013 Reading: Sipser, Chapter 0 Sets Sets are defined by their members A = B means that for every x, x A iff
More informationBounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia
Bounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia Andreas Krause krausea@cs.tum.edu Technical University of Munich February 12, 2003 This survey gives an introduction
More informationPRIME LABELING OF SMALL TREES WITH GAUSSIAN INTEGERS. 1. Introduction
PRIME LABELING OF SMALL TREES WITH GAUSSIAN INTEGERS HUNTER LEHMANN AND ANDREW PARK Abstract. A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationThe Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton
The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for
More informationProf. Dr. Lars Schmidt-Thieme, L. B. Marinho, K. Buza Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course
Course on Bayesian Networks, winter term 2007 0/31 Bayesian Networks Bayesian Networks I. Bayesian Networks / 1. Probabilistic Independence and Separation in Graphs Prof. Dr. Lars Schmidt-Thieme, L. B.
More informationDivide-and-Conquer Algorithms Part Two
Divide-and-Conquer Algorithms Part Two Recap from Last Time Divide-and-Conquer Algorithms A divide-and-conquer algorithm is one that works as follows: (Divide) Split the input apart into multiple smaller
More informationLaboratoire Bordelais de Recherche en Informatique. Universite Bordeaux I, 351, cours de la Liberation,
Laboratoire Bordelais de Recherche en Informatique Universite Bordeaux I, 351, cours de la Liberation, 33405 Talence Cedex, France Research Report RR-1145-96 On Dilation of Interval Routing by Cyril Gavoille
More informationSmall distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao
Small distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao presented by Fjóla Rún Björnsdóttir CSE 254 - Metric Embeddings Winter 2007 CSE 254 - Metric Embeddings - Winter
More informationSensitivity, Block Sensitivity and Certificate Complexity of Boolean Functions (Master s Thesis)
Sensitivity, Block Sensitivity and Certificate Complexity of Boolean Functions (Master s Thesis) Sourav Chakraborty Thesis Advisor: László Babai February, 2005 Abstract We discuss several complexity measures
More informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationIS 709/809: Computational Methods in IS Research Fall Exam Review
IS 709/809: Computational Methods in IS Research Fall 2017 Exam Review Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Exam When: Tuesday (11/28) 7:10pm
More informationFlavia Bonomo, Guillermo Duran, Amedeo Napoli, Mario Valencia-Pabon. HAL Id: hal
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs Flavia Bonomo, Guillermo Duran, Amedeo
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 informationAssignment 5: Solutions
Comp 21: Algorithms and Data Structures Assignment : Solutions 1. Heaps. (a) First we remove the minimum key 1 (which we know is located at the root of the heap). We then replace it by the key in the position
More informationPropositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications
What is discrete math? Propositional Logic The real numbers are continuous in the senses that: between any two real numbers there is a real number The integers do not share this property. In this sense
More informationChapter 1. Comparison-Sorting and Selecting in. Totally Monotone Matrices. totally monotone matrices can be found in [4], [5], [9],
Chapter 1 Comparison-Sorting and Selecting in Totally Monotone Matrices Noga Alon Yossi Azar y Abstract An mn matrix A is called totally monotone if for all i 1 < i 2 and j 1 < j 2, A[i 1; j 1] > A[i 1;
More informationMINORS OF GRAPHS OF LARGE PATH-WIDTH. A Dissertation Presented to The Academic Faculty. Thanh N. Dang
MINORS OF GRAPHS OF LARGE PATH-WIDTH A Dissertation Presented to The Academic Faculty By Thanh N. Dang In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Algorithms, Combinatorics
More informationc 1999 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 1, No. 1, pp. 64 77 c 1999 Society for Industrial and Applied Mathematics OPTIMAL BOUNDS FOR MATCHING ROUTING ON TREES LOUXIN ZHANG Abstract. The permutation routing problem
More informationWheel-free planar graphs
Wheel-free planar graphs Pierre Aboulker Concordia University, Montréal, Canada email: pierreaboulker@gmail.com Maria Chudnovsky Columbia University, New York, NY 10027, USA e-mail: mchudnov@columbia.edu
More informationPath Graphs and PR-trees. Steven Chaplick
Path Graphs and PR-trees by Steven Chaplick A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto Copyright
More informationKernelization Lower Bounds: A Brief History
Kernelization Lower Bounds: A Brief History G Philip Max Planck Institute for Informatics, Saarbrücken, Germany New Developments in Exact Algorithms and Lower Bounds. Pre-FSTTCS 2014 Workshop, IIT Delhi
More informationLower Bounds for Dynamic Connectivity (2004; Pǎtraşcu, Demaine)
Lower Bounds for Dynamic Connectivity (2004; Pǎtraşcu, Demaine) Mihai Pǎtraşcu, MIT, web.mit.edu/ mip/www/ Index terms: partial-sums problem, prefix sums, dynamic lower bounds Synonyms: dynamic trees 1
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 informationRelation between Graphs
Max Planck Intitute for Math. in the Sciences, Leipzig, Germany Joint work with Jan Hubička, Jürgen Jost, Peter F. Stadler and Ling Yang SCAC2012, SJTU, Shanghai Outline Motivation and Background 1 Motivation
More informationOn the longest path in a recursively partitionable graph
On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationOptimal Tree-decomposition Balancing and Reachability on Low Treewidth Graphs
Optimal Tree-decomposition Balancing and Reachability on Low Treewidth Graphs Krishnendu Chatterjee Rasmus Ibsen-Jensen Andreas Pavlogiannis IST Austria Abstract. We consider graphs with n nodes together
More informationA New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality By Markus Bläser
A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality By Markus Bläser Presented By: Chris Standish chriss@cs.tamu.edu 23 November 2005 1 Outline Problem Definition Frieze s Generic
More informationComplexity of determining the most vital elements for the 1-median and 1-center location problems
Complexity of determining the most vital elements for the -median and -center location problems Cristina Bazgan, Sonia Toubaline, and Daniel Vanderpooten Université Paris-Dauphine, LAMSADE, Place du Maréchal
More informationarxiv: v3 [math.co] 19 Sep 2018
Decycling Number of Linear Graphs of Trees arxiv:170101953v3 [mathco] 19 Sep 2018 Jian Wang a, Xirong Xu b, a Department of Mathematics Taiyuan University of Technology, Taiyuan, 030024, PRChina b School
More informationA Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs
A Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs Ruo-Wei Hung Department of Information Management Nan-Kai Institute of Technology, Tsao-Tun, Nantou 54, Taiwan rwhung@nkc.edu.tw
More informationA basis for the non-crossing partition lattice top homology
J Algebr Comb (2006) 23: 231 242 DOI 10.1007/s10801-006-7395-5 A basis for the non-crossing partition lattice top homology Eliana Zoque Received: July 31, 2003 / Revised: September 14, 2005 / Accepted:
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationCS 372: Computational Geometry Lecture 4 Lower Bounds for Computational Geometry Problems
CS 372: Computational Geometry Lecture 4 Lower Bounds for Computational Geometry Problems Antoine Vigneron King Abdullah University of Science and Technology September 20, 2012 Antoine Vigneron (KAUST)
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 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 informationClique trees of infinite locally finite chordal graphs
Clique trees of infinite locally finite chordal graphs Florian Lehner & Christoph Temmel Abstract We investigate clique trees of infinite, locally finite chordal graphs. Our key tool is a bijection between
More informationLarge Cliques and Stable Sets in Undirected Graphs
Large Cliques and Stable Sets in Undirected Graphs Maria Chudnovsky Columbia University, New York NY 10027 May 4, 2014 Abstract The cochromatic number of a graph G is the minimum number of stable sets
More informationGRAPH PARTITIONING USING SINGLE COMMODITY FLOWS [KRV 06] 1. Preliminaries
GRAPH PARTITIONING USING SINGLE COMMODITY FLOWS [KRV 06] notes by Petar MAYMOUNKOV Theme The algorithmic problem of finding a sparsest cut is related to the combinatorial problem of building expander graphs
More informationApplication of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs
Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs Mikhail Klin Christian Pech 1 Department of Mathematics Ben Gurion University of the
More informationSolving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang To cite this version: Philippe
More informationFactoring and Recognition of Read-Once Functions using Cographs and Normality and the Readability of Functions Associated with Partial k-trees
Factoring and Recognition of Read-Once Functions using Cographs and Normality and the Readability of Functions Associated with Partial k-trees Martin Charles Golumbic Aviad Mintz Udi Rotics September 8,
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationCollective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width Feodor F. Dragan and Chenyu Yan Department of Computer Science, Kent State University, Kent, OH 44242 {dragan,
More informationPartitions and Covers
University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Dong Wang Date: January 2, 2012 LECTURE 4 Partitions and Covers In previous lectures, we saw
More informationarxiv: v1 [cs.dm] 4 May 2018
Connected greedy colouring in claw-free graphs arxiv:1805.01953v1 [cs.dm] 4 May 2018 Ngoc Khang Le and Nicolas Trotignon November 9, 2018 Abstract An ordering of the vertices of a graph is connected if
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationEdge colored complete bipartite graphs with trivial automorphism groups
Edge colored complete bipartite graphs with trivial automorphism groups Michael J. Fisher Garth Isaak Abstract We determine the values of s and t for which there is a coloring of the edges of the complete
More informationUndirected Graphical Models
Undirected Graphical Models 1 Conditional Independence Graphs Let G = (V, E) be an undirected graph with vertex set V and edge set E, and let A, B, and C be subsets of vertices. We say that C separates
More informationarxiv: v1 [cs.gr] 25 Nov 2015
EMBEDDING OF HYPERCUBE INTO CYLINDER WEIXING JI, QINGHUI LIU, GUIZHEN WANG, AND ZHUOJIA SHEN arxiv:1511.07932v1 [cs.gr] 25 Nov 2015 Abstract. Task mapping in modern high performance parallel computers
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More information4-coloring P 6 -free graphs with no induced 5-cycles
4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,
More informationNotes on Logarithmic Lower Bounds in the Cell Probe Model
Notes on Logarithmic Lower Bounds in the Cell Probe Model Kevin Zatloukal November 10, 2010 1 Overview Paper is by Mihai Pâtraşcu and Erik Demaine. Both were at MIT at the time. (Mihai is now at AT&T Labs.)
More informationABSTRACT 1. INTRODUCTION
THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at
More informationBranchwidth of graphic matroids.
Branchwidth of graphic matroids. Frédéric Mazoit and Stéphan Thomassé Abstract Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationConnected Component Tree
onnected omponent Tree Jean ousty OUR-DAY OURSE on Mathematical Morphology in image analysis Bangalore 19- October 010 Motivation onnectivity plays important role for image processing Morphological connected
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationTree-width and algorithms
Tree-width and algorithms Zdeněk Dvořák September 14, 2015 1 Algorithmic applications of tree-width Many problems that are hard in general become easy on trees. For example, consider the problem of finding
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationQuick Tour of Linear Algebra and Graph Theory
Quick Tour of Linear Algebra and Graph Theory CS224W: Social and Information Network Analysis Fall 2014 David Hallac Based on Peter Lofgren, Yu Wayne Wu, and Borja Pelato s previous versions Matrices and
More informationIrredundant generating sets and dimension-like invariants of the finite group arxiv: v2 [math.gr] 13 Dec 2017
Irredundant generating sets and dimension-like invariants of the finite group arxiv:1712.03923v2 [math.gr] 13 Dec 2017 Minh Nguyen April 9, 2018 Abstract Whiston proved that the maximum size of an irredundant
More informationApproximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Proc. 4th TAMC, 27 Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems Michael Dom, Jiong Guo, and Rolf Niedermeier Institut für Informatik, Friedrich-Schiller-Universität
More informationThe last fraction of a fractional conjecture
Author manuscript, published in "SIAM Journal on Discrete Mathematics 24, 2 (200) 699--707" DOI : 0.37/090779097 The last fraction of a fractional conjecture František Kardoš Daniel Král Jean-Sébastien
More informationRECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS
RECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS WILL JOHNSON Abstract. We consider the problem of recovering nonlinear conductances in a circular planar graph. If the graph is critical
More informationLIST OF SELECTED PAPERS SLOBODAN K. SIMIĆ April 2017
LIST OF SELECTED PAPERS SLOBODAN K. SIMIĆ April 2017 (1) A. Al-Azemi, M. An delić, S.K. Simić, Eigenvalue location for chain graphs, Linear Algebra Appl., 505(2016), 194-210. (2) F. Belardo, E.M. Li Marzi,
More informationA Lex-BFS-based recognition algorithm for Robinsonian matrices
A Lex-BFS-based recognition algorithm for Robinsonian matrices Monique Laurent 1,2 and Matteo Seminaroti 1 1 Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, The Netherlands 2
More informationThe integers. Chapter 3
Chapter 3 The integers Recall that an abelian group is a set A with a special element 0, and operation + such that x +0=x x + y = y + x x +y + z) =x + y)+z every element x has an inverse x + y =0 We also
More informationarxiv: v1 [math.co] 11 Jul 2016
Characterization and recognition of proper tagged probe interval graphs Sourav Chakraborty, Shamik Ghosh, Sanchita Paul and Malay Sen arxiv:1607.02922v1 [math.co] 11 Jul 2016 October 29, 2018 Abstract
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationGraceful Labelings. Charles Michael Cavalier. Bachelor of Science Louisiana State University 2006
Graceful Labelings By Charles Michael Cavalier Bachelor of Science Louisiana State University 2006 Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Mathematics
More informationFinding cut-vertices in the square roots of a graph
Finding cut-vertices in the square roots of a graph Guillaume Ducoffe To cite this version: Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. [Research Report] Université Côte d Azur,
More informationGenerating p-extremal graphs
Generating p-extremal graphs Derrick Stolee Department of Mathematics Department of Computer Science University of Nebraska Lincoln s-dstolee1@math.unl.edu August 2, 2011 Abstract Let f(n, p be the maximum
More informationComputing branchwidth via efficient triangulations and blocks
Computing branchwidth via efficient triangulations and blocks Fedor Fomin Frédéric Mazoit Ioan Todinca Abstract Minimal triangulations and potential maximal cliques are the main ingredients for a number
More informationApproximation Algorithms for the k-set Packing Problem
Approximation Algorithms for the k-set Packing Problem Marek Cygan Institute of Informatics University of Warsaw 20th October 2016, Warszawa Marek Cygan Approximation Algorithms for the k-set Packing Problem
More information