60 th Birthday of Andreas. 16th Birthday of Dually Chordal Graphs
|
|
|
- Elisabeth Hamilton
- 6 years ago
- Views:
Transcription
1
2 60 th Birthday of Andreas 16th Birthday of Dually Chordal Graphs
3 60 th Birthday of Andreas 16th Birthday of Dually Chordal Graphs Sixteen Sixty: a small event accompanying a big event
4 60 th Birthday of Andreas 16th Birthday of Dually Chordal Graphs
5 60 th Birthday of Andreas 16th Birthday of Dually Chordal Graphs Subtrees of a tree Chordal graph Dually Chordal graph
6 60 th Birthday of Andreas 16th Birthday of Dually Chordal Graphs Navigating in Dually Chordal Graphs
7 Navigating in Dually Chordal Graphs Two facets/aspects Navigating in a graph
8 Navigating in Dually Chordal Graphs Two facets/aspects Navigating in publications (through Dually Chordal graphs)
9 It turns out that I published more papers with Andreas than with anybody else
10 It turns out that the converse is also true
11 Some contributions, I had a luck to make with Andreas G is dually chordal There is a maximum neighborhood ordering of vertices of G There is a locally connected spanning tree T, i.e., for any v, N[v,G] T is a subtree of T There is a spanning tree T such that any maximal clique of G induces a subtree in T G is K(G) for some chordal graph G is the 2-section graph of paths of a tree.
12 Some contributions, I had a luck to make with Andreas G is dually chordal There is a maximum neighborhood ordering of vertices of G There is a locally connected spanning tree T, i.e., for any v, N[v,G] T is a subtree of T There is a spanning tree T such that any maximal clique of G induces a subtree in T G is K(G) for some chordal graph G is the 2-section graph of paths of a tree.
13 Some contributions, I had a luck to make with Andreas Some Some Some Some weird weird citations citations citations citations
14 Some contributions, I had a luck to make with Andreas (among other results) r-dominating clique can be found in linear time in a dually chordal graph generalization and run-time improvement of Strongly chordal graphs are exactly hereditary dually chordal graphs
15 I tried to avoid self-citations but could not avoid friend's citations
16 Some contributions, I had a luck to make with Andreas On this long way
17 Some contributions, I had a luck to make with Andreas On this long way
18 Editors Choice for 1998 Linear time algorithms for problems recognition and mn-ordering r-domination r-packing connected r-domination Steiner trees centers, diameters p-centers with duality results Improves results for strongly chordal graphs
19 Some contributions, I had a luck to make with Andreas Some Some Some Some weird weird citations citations citations citations
20 Some contributions, I had a luck to make with Andreas Unified linear time algorithm for r-domination r-packing clique transversal clique matching with duality results First paper written not by mail (VW project, Duisburg)
21 Some Some Some Some more citations citations citations citations Some contributions, I had a luck to make with Andreas weird weird citation
22 Duisburg (VW-Stiftung Stiftung, DAAD)
23 Rostock (DFG Project)
24 Rostock (DFG Project)
25 Some contributions, I had a luck to make with Andreas DFG project, Rostock if G=(V,E) is chordal then there is a tree T=(V,U) with also also also also we we we we in in in in CIAC' CIAC' CIAC' CIAC' for any x,y in V (a distance 2-approximating tree) if G=(V,E) is dually chordal then there is a spanning tree T=(V,U) with for any x,y in V (an additive tree 3-spanner)
26 Some contributions, I had a luck to make with Andreas DFG project, Rostock more citations more citations a new layering tree and level clustering? our PODC 2008 submission (????)
27 Some more contributions, I had a luck to make with Andreas
28 Some more contributions, I had a luck to make with Andreas
29 New Results Additive r-carcass: Each vertex knows its neighbors and O(logn) digits from the tree
30 Navigating in a Dually Chordal Graph Additive r-carcass: Each vertex knows its neighbors and O(logn) digits from the tree
31 New Results (not published) Additive r-frame: Each vertex knows its neighbors and 2 digits from the tree
32 Navigating in a Dually Chordal Graph Additive r-frame: Each vertex knows its neighbors and 2 digits from the tree
33 How to find a locally connected spanning tree in a Dually Chordal graph w(e) := # of triangles edge e belongs to 1 Find maximum weight spanning tree 3
34 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas.
35 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas.
36 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started.
37 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself
38 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number.
39 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number. Let define Andreas index to be the ratio of those two numbers (the number of papers over the number of years).
40 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number. Let define Andreas index to be the ratio of those two numbers (the number of papers over the number of years) myself
41 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number. Let define Andreas index to be the ratio of those two numbers (the number of papers over the number of years) myself Challenging open problem: Is number 60 achievable?
42 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number. Let define Andreas index to be the ratio of those two numbers (the number of papers over the number of years) myself Challenging open problem: Is number 6.0 achievable?
43 Open problems Let define Co-Andr number to be the number of papers you have coauthored with Andreas. Let define Andr-Coll Coll-Start number to be the number of years since the collaboration with Andreas has started. 17 myself Conjecture 1: It is hard (NP-hard?) to bound the Co-Andr number. Conjecture 2: It is easy (linear?) to increase the Andr-Coll Coll-Start number. Let define Andreas index to be the ratio of those two numbers (the number of papers over the number of years) myself Challenging open problem: Is number 6.0 achievable? At least 6 papers per year, not many
44 Happy 60 th Birthday, Andreas!!!
45 Happy 60 th Birthday, Andreas!!!
46 Happy 60 th Birthday, Andreas!!!
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
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs Andreas Brandstädt, Arne Leitert, Dieter Rautenbach University of Rostock University of Ulm The Problem Domination D V with N[d]
CS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
Tree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
On the Complexity of Some Packing and Covering Problems in Graphs and Hypergraphs
On the Complexity of Some Packing and Covering Problems in Graphs and Hypergraphs Andreas Brandstädt University of Rostock, Germany (with C. Hundt, A. Leitert, M. Milanič, R. Mosca, R. Nevries, and D.
Collective Tree Spanners of Unit Disk Graphs with Applications to Compact and Low Delay Routing Labeling Schemes. F.F. Dragan
Collective Tree Spanners of Unit Disk Graphs with Applications to Compact and Low Delay Routing Labeling Schemes F.F. Dragan (joint work with Yang Xiang and Chenyu Yan) Kent State University, USA Well-known
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics 156 (2008) 3345 3361 www.elsevier.com/locate/dam Closest 4-leaf power is fixed-parameter tractable Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier Institut für Informatik,
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
Extremal 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
ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
6 Euler Circuits and Hamiltonian Cycles
November 14, 2017 6 Euler Circuits and Hamiltonian Cycles William T. Trotter trotter@math.gatech.edu EulerTrails and Circuits Definition A trail (x 1, x 2, x 3,, x t) in a graph G is called an Euler trail
Hong-Gwa Yeh and Gerard J. Chang. 1. Introduction
TAIWANESE JOURNAL OF MATHEMATICS Vol. 2, No. 3, pp. 353-360, September 1998 THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS Hong-Gwa Yeh and Gerard J. Chang Abstract. A path partition
Strongly 2-connected orientations of graphs
Downloaded from orbit.dtu.dk on: Jul 04, 2018 Strongly 2-connected orientations of graphs Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to article, DOI: 10.1016/j.jctb.2014.07.004
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Computación, Facultad de Ciencias
There are two types of problems:
Np-complete Introduction: There are two types of problems: Two classes of algorithms: Problems whose time complexity is polynomial: O(logn), O(n), O(nlogn), O(n 2 ), O(n 3 ) Examples: searching, sorting,
Enumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
Chapter 3: Proving NP-completeness Results
Chapter 3: Proving NP-completeness Results Six Basic NP-Complete Problems Some Techniques for Proving NP-Completeness Some Suggested Exercises 1.1 Six Basic NP-Complete Problems 3-SATISFIABILITY (3SAT)
4-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,
CLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
Spanning Trees, Tree Covers and Spanners
Spanning Trees, Tree Covers and Spanners Consider a weighted connected graph G=(V, E, w), where w:e R assigns a nonnegative weight w(e) to each edge e, representing its length. In the following we only
CSE 421 NP-Completeness
CSE 421 NP-Completeness Yin at Lee 1 Cook-Levin heorem heorem (Cook 71, Levin 73): 3-SA is NP-complete, i.e., for all problems A NP, A p 3-SA. (See CSE 431 for the proof) So, 3-SA is the hardest problem
COMPUTING GRAPH ROOTS WITHOUT SHORT CYCLES
Symposium on Theoretical Aspects of Computer Science 2009 (Freiburg), pp. 397 408 www.stacs-conf.org COMPUTING GRAPH ROOTS WITHOUT SHORT CYCLES BABAK FARZAD 1 AND LAP CHI LAU 2 AND VAN BANG LE 3 AND NGUYEN
Variable Elimination (VE) Barak Sternberg
Variable Elimination (VE) Barak Sternberg Basic Ideas in VE Example 1: Let G be a Chain Bayesian Graph: X 1 X 2 X n 1 X n How would one compute P X n = k? Using the CPDs: P X 2 = x = x Val X1 P X 1 = x
A Cubic-Vertex Kernel for Flip Consensus Tree
To appear in Algorithmica A Cubic-Vertex Kernel for Flip Consensus Tree Christian Komusiewicz Johannes Uhlmann Received: date / Accepted: date Abstract Given a bipartite graph G = (V c, V t, E) and a nonnegative
On the inverse matrix of the Laplacian and all ones matrix
On the inverse matrix of the Laplacian and all ones matrix Sho Suda (Joint work with Michio Seto and Tetsuji Taniguchi) International Christian University JSPS Research Fellow PD November 21, 2012 Sho
Hendry s Conjecture on Chordal Graph Subclasses
Lehigh University Lehigh Preserve Theses and Dissertations 2017 Hendry s Conjecture on Chordal Graph Subclasses Aydin Gerek Lehigh University Follow this and additional works at: http://preserve.lehigh.edu/etd
Induced 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
Strongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
1 Non-deterministic Turing Machine
1 Non-deterministic Turing Machine A nondeterministic Turing machine is a generalization of the standard TM for which every configuration may yield none, or one or more than one next configurations. In
The Local Representation of Graphs Conjecture
The Local Representation of Graphs Conjecture Ed Scheinerman Department of Applied Mathematics & Statistics Johns Hopkins University SIAM Discrete Mathematics Conference Halifax, 2012 How do we store a
More on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
Weighted Upper Domination. Arman Boyacı, Bogazici University, Turkey Jérôme Monnot, Université Paris-Dauphine, LAMSADE, France
Weighted Upper Domination Arman Boyacı, Bogazici University, Turkey Jérôme Monnot, Université Paris-Dauphine, LAMSADE, France Abstract - Upper Domination Number: the cardinality of maximum minimal dominating
THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES
COMBINATORICA Bolyai Society Springer-Verlag Combinatorica 10pp. DOI: 10.1007/s00493-015-3291-8 THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES HENRY A. KIERSTEAD*, ALEXANDR V. KOSTOCHKA,
On graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
July 18, Approximation Algorithms (Travelling Salesman Problem)
Approximation Algorithms (Travelling Salesman Problem) July 18, 2014 The travelling-salesman problem Problem: given complete, undirected graph G = (V, E) with non-negative integer cost c(u, v) for each
The path of order 5 is called the W-graph. Let (X, Y ) be a bipartition of the W-graph with X = 3. Vertices in X are called big vertices, and vertices
The Modular Chromatic Number of Trees Jia-Lin Wang, Jie-Ying Yuan Abstract:The concept of modular coloring and modular chromatic number was proposed by F. Okamoto, E. Salehi and P. Zhang in 2010. They
Recall: Matchings. Examples. K n,m, K n, Petersen graph, Q k ; graphs without perfect matching
Recall: Matchings A matching is a set of (non-loop) edges with no shared endpoints. The vertices incident to an edge of a matching M are saturated by M, the others are unsaturated. A perfect matching of
The complexity of Sur-Hom(C 4 )
The complexity of Sur-Hom(C 4 ) Barnaby Martin and Danïel Paulusma Algorithms and Complexity in Durham, 7th Slovenian International Conference on Graph Theory Bled 11 25th June, 2011 My introduction to
k-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
In complexity theory, algorithms and problems are classified by the growth order of computation time as a function of instance size.
10 2.2. CLASSES OF COMPUTATIONAL COMPLEXITY An optimization problem is defined as a class of similar problems with different input parameters. Each individual case with fixed parameter values is called
Supporting hyperplanes
Supporting hyperplanes General approach when using Lagrangian methods Lecture 1 homework Shadow prices A linear programming problem The simplex tableau Simple example with cycling The pivot rule being
The 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,
Probe interval graphs and probe unit interval graphs on superclasses of cographs
Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs
A Note on Roman {2}-domination problem in graphs
A Note on Roman {2}-domination problem in graphs arxiv:1804.09338v3 [math.co] 17 Feb 2019 Hangdi Chen and Changhong Lu School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal
Bayesian & Markov Networks: A unified view
School of omputer Science ayesian & Markov Networks: unified view Probabilistic Graphical Models (10-708) Lecture 3, Sep 19, 2007 Receptor Kinase Gene G Receptor X 1 X 2 Kinase Kinase E X 3 X 4 X 5 TF
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
CS/COE
CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ P vs NP But first, something completely different... Some computational problems are unsolvable No algorithm can be written that will always produce the correct
arxiv: v3 [cs.ds] 24 Jul 2018
![arxiv: v3 [cs.ds] 24 Jul 2018](/thumbs/87/95878176.jpg "arxiv: v3 [cs.ds] 24 Jul 2018")
New Algorithms for Weighted k-domination and Total k-domination Problems in Proper Interval Graphs Nina Chiarelli 1,2, Tatiana Romina Hartinger 1,2, Valeria Alejandra Leoni 3,4, Maria Inés Lopez Pujato
Probability Propagation
Graphical Models, Lecture 12, Michaelmas Term 2010 November 19, 2010 Characterizing chordal graphs The following are equivalent for any undirected graph G. (i) G is chordal; (ii) G is decomposable; (iii)
arxiv: v1 [cs.dm] 4 May 2018
![arxiv: v1 [cs.dm] 4 May 2018](/thumbs/93/113803119.jpg "arxiv: 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
Generalized Subgraph-Restricted Matchings in Graphs
Generalized Subgraph-Restricted Matchings in Graphs Wayne Goddard a Sandra M. Hedetniemi a Stephen T. Hedetniemi a Renu Laskar b a Dept of Computer Science, Clemson University, Clemson SC 29634, USA b
Steiner Trees in Chip Design. Jens Vygen. Hangzhou, March 2009
Steiner Trees in Chip Design Jens Vygen Hangzhou, March 2009 Introduction I A digital chip contains millions of gates. I Each gate produces a signal (0 or 1) once every cycle. I The output signal of a
New Results on Graph Packing
Graph Packing p.1/18 New Results on Graph Packing Hemanshu Kaul hkaul@math.uiuc.edu www.math.uiuc.edu/ hkaul/. University of Illinois at Urbana-Champaign Graph Packing p.2/18 Introduction Let G 1 = (V
On the Path-width of Planar Graphs
On the Path-width of Planar Graphs Omid Amini 1,2 Florian Huc 1 Stéphane Pérennes 1 FirstName.LastName@sophia.inria.fr Abstract In this paper, we present a result concerning the relation between the path-with
10.3 Matroids and approximation
10.3 Matroids and approximation 137 10.3 Matroids and approximation Given a family F of subsets of some finite set X, called the ground-set, and a weight function assigning each element x X a non-negative
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
On (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
Leray Complexes - Combinatorics and Geometry
Leray Complexes - Combinatorics and Geometry Roy Meshulam Technion Israel Institute of Technology Joint work with Gil Kalai Plan Introduction Helly s Theorem d-representable, d-collapsible & d-leray complexes
NP-Hardness reductions
NP-Hardness reductions Definition: P is the class of problems that can be solved in polynomial time, that is n c for a constant c Roughly, if a problem is in P then it's easy, and if it's not in P then
Differential approximation results for the Steiner tree problem
Differential approximation results for the Steiner tree problem Marc Demange, Jérôme Monnot, Vangelis Paschos To cite this version: Marc Demange, Jérôme Monnot, Vangelis Paschos. Differential approximation
arxiv: v1 [cs.dm] 29 Oct 2012
![arxiv: v1 [cs.dm] 29 Oct 2012](/thumbs/85/91540498.jpg "arxiv: v1 [cs.dm] 29 Oct 2012")
arxiv:1210.7684v1 [cs.dm] 29 Oct 2012 Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. Babak Farzad 1 and Majid Karimi 2 Department of Mathematics Brock University, St. Catharines,
A Note on an Induced Subgraph Characterization of Domination Perfect Graphs.
A Note on an Induced Subgraph Characterization of Domination Perfect Graphs. Eglantine Camby & Fränk Plein Université Libre de Bruxelles Département de Mathématique Boulevard du Triomphe, 1050 Brussels,
Easy Problems vs. Hard Problems. CSE 421 Introduction to Algorithms Winter Is P a good definition of efficient? The class P
Easy Problems vs. Hard Problems CSE 421 Introduction to Algorithms Winter 2000 NP-Completeness (Chapter 11) Easy - problems whose worst case running time is bounded by some polynomial in the size of the
Bounded 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
Discrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
CATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES
CATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES NANCY EATON AND GLENN FAUBERT Abstract. A caterpillar, H, is a tree containing a path, P, such that every vertex of H is either in P or adjacent to P. Given
1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
Tree-chromatic number
Tree-chromatic number Paul Seymour 1 Princeton University, Princeton, NJ 08544 November 2, 2014; revised June 25, 2015 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563. Abstract Let
arxiv: v2 [math.co] 19 Aug 2015
![arxiv: v2 [math.co] 19 Aug 2015](/thumbs/92/109782032.jpg "arxiv: v2 [math.co] 19 Aug 2015")
THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES H.A. KIERSTEAD, A.V. KOSTOCHKA, AND E.C. YEAGER arxiv:1406.7453v2 [math.co] 19 Aug 2015 Abstract. In 1963, Corrádi and Hajnal proved that
On disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
Chapter 6. Linear Programming: The Simplex Method. 6.1 Geometric Introduction to the Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 1 A Geometric Introduction to the Simplex Method 6.1 Geometric Introduction to the Simplex Method The geometric method of linear programming from
Testing Equality in Communication Graphs
Electronic Colloquium on Computational Complexity, Report No. 86 (2016) Testing Equality in Communication Graphs Noga Alon Klim Efremenko Benny Sudakov Abstract Let G = (V, E) be a connected undirected
On the S-Labeling problem
On the S-Labeling problem Guillaume Fertin Laboratoire d Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes, 2 rue de la Houssinière, 4422 Nantes Cedex - France guillaume.fertin@univ-nantes.fr
Connected Placement of Disaster Shelters in Modern Cities
Connected Placement of Disaster Shelters in Modern Cities Huanyang Zheng and Jie Wu Dept. of Computer and Info. Sciences Temple University Road Map Introduction Model and Formulation Algorithms Experiments
arxiv: v3 [cs.dm] 18 Oct 2017
![arxiv: v3 [cs.dm] 18 Oct 2017](/thumbs/76/73498857.jpg "arxiv: v3 [cs.dm] 18 Oct 2017")
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes arxiv:1707.02473v3 [cs.dm] 18 Oct 2017 Fábio Protti and Uéverton dos Santos Souza Institute of Computing - Universidade
Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016
CS 267 Lecture 7 Graph Spanners Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016 1 Graph Spanners Our goal is to compress information about distances in a graph by looking
Example: multivariate Gaussian Distribution
School of omputer Science Probabilistic Graphical Models Representation of undirected GM (continued) Eric Xing Lecture 3, September 16, 2009 Reading: KF-chap4 Eric Xing @ MU, 2005-2009 1 Example: multivariate
Complexity 1: Motivation. Outline. Dusko Pavlovic. Introductions. Algorithms. Introductions. Complexity 1: Motivation. Contact.
Outline Complexity Theory Part 1: Defining complexity Complexity of algorithms RHUL Spring 2012 Outline Contact Defining complexity email: dusko.pavlovic@rhul.ac.uk phone: (01784 44 30 81) Complexity of
CS Fall 2011 P and NP Carola Wenk
CS3343 -- Fall 2011 P and NP Carola Wenk Slides courtesy of Piotr Indyk with small changes by Carola Wenk 11/29/11 CS 3343 Analysis of Algorithms 1 We have seen so far Algorithms for various problems Running
Complexity Classes V. More PCPs. Eric Rachlin
Complexity Classes V More PCPs Eric Rachlin 1 Recall from last time Nondeterminism is equivalent to having access to a certificate. If a valid certificate exists, the machine accepts. We see that problems
arxiv: v2 [cs.dm] 17 Nov 2012
![arxiv: v2 [cs.dm] 17 Nov 2012](/thumbs/90/102829614.jpg "arxiv: v2 [cs.dm] 17 Nov 2012")
The star and biclique coloring and choosability problems Marina Groshaus Francisco J. Soulignac Pablo Terlisky {groshaus,fsoulign,terlisky}@dc.uba.ar arxiv:1210.7269v2 [cs.dm] 17 Nov 2012 Abstract A biclique
arxiv: v1 [math.co] 28 Oct 2016
![arxiv: v1 [math.co] 28 Oct 2016](/thumbs/92/108819504.jpg "arxiv: v1 [math.co] 28 Oct 2016")
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called
A taste of perfect graphs
A taste of perfect graphs Remark Determining the chromatic number of a graph is a hard problem, in general, and it is even hard to get good lower bounds on χ(g). An obvious lower bound we have seen before
Edge-maximal graphs of branchwidth k
Electronic Notes in Discrete Mathematics 22 (2005) 363 368 www.elsevier.com/locate/endm Edge-maximal graphs of branchwidth k Christophe Paul 1 CNRS - LIRMM, Montpellier, France Jan Arne Telle 2 Dept. of
Undirected Graphical Models 4 Bayesian Networks and Markov Networks. Bayesian Networks to Markov Networks
Undirected Graphical Models 4 ayesian Networks and Markov Networks 1 ayesian Networks to Markov Networks 2 1 Ns to MNs X Y Z Ns can represent independence constraints that MN cannot MNs can represent independence
arxiv: v1 [math.mg] 11 Jan 2011
![arxiv: v1 [math.mg] 11 Jan 2011](/thumbs/90/102013995.jpg "arxiv: v1 [math.mg] 11 Jan 2011")
arxiv:1101.2117v1 [math.mg] 11 Jan 2011 The Length of a Minimal Tree With a Given Topology: generalization of Maxwell Formula A.O. Ivanov, A.A. Tuzhilin September 26, 2018 Abstract The classic Maxwell
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
Dynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
Local Search Based Approximation Algorithms. Vinayaka Pandit. IBM India Research Laboratory
Local Search Based Approximation Algorithms The k-median problem Vinayaka Pandit IBM India Research Laboratory joint work with Naveen Garg, Rohit Khandekar, and Vijay Arya The 2011 School on Approximability,
Contents. Typical techniques. Proving hardness. Constructing efficient algorithms
Contents Typical techniques Proving hardness Constructing efficient algorithms Generating Maximal Independent Sets Consider the generation of all maximal sets of an independence system. Generating Maximal
Probability Propagation
Graphical Models, Lectures 9 and 10, Michaelmas Term 2009 November 13, 2009 Characterizing chordal graphs The following are equivalent for any undirected graph G. (i) G is chordal; (ii) G is decomposable;
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
On Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
Paths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
A Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs
A Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs Hein van der Holst Georgia State University Conference honouring Robin s 50th birthday Joint work with Marina Arav, Frank
Clique trees & Belief Propagation. Siamak Ravanbakhsh Winter 2018
Graphical Models Clique trees & Belief Propagation Siamak Ravanbakhsh Winter 2018 Learning objectives message passing on clique trees its relation to variable elimination two different forms of belief
Lecture 13: Spectral Graph Theory
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 13: Spectral Graph Theory Lecturer: Shayan Oveis Gharan 11/14/18 Disclaimer: These notes have not been subjected to the usual scrutiny reserved
k-means Clustering Raten der µi Neubestimmung µi Zuordnungsschritt Konvergenz
k-means Clustering Neubestimmung µi Konvergenz Raten der µi Zuordnungsschritt Sebastian Böcker Bioinformatik und Genomforschung Clustering Microarrays 1 Parameterized algorithms and FPT we want to find