Chordal Graphs: Theory and Algorithms
|
|
- Harriet Harris
- 6 years ago
- Views:
Transcription
1 Chordal Graphs: Theory and Algorithms 1
2 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also called rigid circuit graphs, Perfect Elimination Graphs, Triangulated Graphs, monotone transitive graphs. 2
3 Subclasses of Chordal Graphs Trees K-trees ( 1-tree is tree) K n : Complete Graph Block Graphs Bipartite Graph with bipartition X and Y ( not necessarily Chordal ) Split Graphs: Make one part of Bipartite graph complete Interval Graphs 3
4 Subclasses of Chordal Graphs Rooted Directed Path Graphs Directed Path Graphs Path Graphs Strongly Chordal Graphs Doubly Chordal Graphs 4
5 Research Issues in Trees Computing Achromatic number in tree is NP-Hard Conjecture: Every tree is Graceful L(2,1)-labeling number of a tree with maximum degree is either +1 or +2. Characterize trees having L(2,1)-labeling number +1 5
6 Why Study a Special Graph Class? Reasons The Graph Class arises from applications The graph class posses some interesting structures that helps solving certain hard but important problems restricted to this class some interesting meaningful theory can be developed in this class. All of these are true for chordal Graphs. Hence study Chordal Graphs. See the book: Graph Classes (next slide) 6
7 7
8 Characterizing Property: Minimal separators are cliques ( Dirac 1961) Characterizing Property: Every minimal a-b vertex separator is a clique ( Complete Subgraph) Minimal a-b Separator: S V is a minimal vertex separator if a and b lie in different components of G-S and no proper subset of S has this property. 8
9 Lemma 1 A vertex x of G is called simplicial if its adjacency set Adj(x) is a clique (not necessarily maximal) Lemma 1[Dirac 1961]: Each chordal graph has a simplicial vertex and if G is not a clique it has two non adjacent simplicial vertices. 9
10 Proof of Lemma 1 If G is a clique, done. If not, assume that G has two non-adjacent nodes a and b and that the lemma is true to all graphs with fewer vertices than G. Let S be a minimal vertex separator for a and b. Let G a and G b be the connected components of a and b respectively. 1 0
11 Proof of Lemma 1 (Cont.) S is a clique if not, then there exists x and y such that there is no edge between them, and because S is minimal vertex separator there is a cycle <a,,x,,b,,y,,a>. It is easy to show that there exist a minimal cycle with length no less then 4 with no chords in it, contradiction. 1 1
12 Proof of Lemma 1 (Cont.) S is a clique. G A +S is smaller than G therefore by induction the lemma holds, i.e. G A +S is a clique or has two non adjacent simplicial vertices, one of each must be in G A. Any simplicial vertex in G A is a simplicial vertex in G because all elements of Adj(A) are inside G A +S. Thus from G A and G B we get two simplicial vertices in G. 1 2
13 Characterizing Property: PEO ( Fulkerson and Gross 1965) Lemma: (Dirac 1961) Every chordal graph has a simplicial vertex. If G is not complete, then it has two non-adjacent simplicial vertices. Simplicial: G[N G (v)] is complete Theorem: G is chordal iff it has a Perfect Elimination Ordering 1 2 G (1,2,3,4,5) is a PEO of G PEO: (v 1,v 2,,v n ) is a PEO if v i is a simplicial vertex of G[{v i,v i+1,,v n }], 1 i n. 13
14 PEO Illustration Perfect Elimination order : necessary and sufficient condition for Chordal graphs Simplicial vertex : along with their neighbors form a clique 14
15 Theorem 7 Definition: The following are equivalent: 1. G is chordal 2. The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3. G has a perfect vertex elimination scheme. 4. There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 1 5
16 Proof of Theorem 7 (1 2) By lemma 1 every chordal graph has a simplicial vertex Direct all of its edges to it Repeat the process with the rest of the graph (can be done because being chordal is hereditary) From the definition of simplicial vertex corollary that each two converging edges coming from adjacent vertices. 1 6
17 Proof of Theorem 7 (2 1) Let there be a cycle of size larger than 3. There exist a valid direction which is acyclic There are two converging edges, which come from two adjacent vertices The cycle has a chord. 1 7
18 Perfect Vertex Elimination Let G=(V,E) be an undirected graph and let σ=[v 1,v 2,,v n ] be an ordering of the vertices. We say that σ is a perfect vertex elimination scheme if for each i: X i = { v j in Adj(v i ) j>i } is complete. 1 8
19 Theorem 7 (Cont.) Definition: The following are equivalent: 1. G is chordal 2. The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3. G has a perfect vertex elimination scheme. 4. There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 1 9
20 Proof of Theorem 7 (1 3) By lemma 1, G has a simplicial vertex. The subgraph induced after removing this vertex is also chordal. By induction, there is an elimination order. 2 0
21 Proof of Theorem 7 (3 1) Let us assume a cycle of length 4 or greater. Let x be the first vertex on the elimination scheme of this cycle. x is simplicial at this point. Two vertices adjacent to x from the cycle are also adjacent between themselves. 2 1
22 Theorem 7 (Cont.) Definition: The following are equivalent: 1. G is chordal 2. The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3. G has a perfect vertex elimination scheme. 4. There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 2 2
23 Clique Tree Example a b a c C 1 b C 1 c e C 3 C 2 d b c d C 2 b C 3 e d 2 3
24 Proof of Theorem 7 (1 4) Lemma 2: A vertex is simplicial iff it belongs to exactly one clique. Let G =(V,E) be a chordal graph and V =k Proof by induction: Assume the claim holds for all graphs of size < k. By Lemma 1 G has a simplicial vertex v. By Lemma 2 v belongs to exactly one clique C. 2 4
25 Proof of Theorem 7 (1 4) For G =(V\{v},E ) there exists a tree T which satisfies the claim. Split into two cases: C = C {v} is maximal in G. Add v to C to build T from T. T is a Clique-Tree as needed. a b C 1 c a C 1 b C 2 e C 2 d b c e d 2 5
26 Proof of Theorem 7 (1 4) C = C {v} is not maximal in G. There is a maximal clique P in G such that C P. Add C and (C, P) to T to build T. T is a Clique-Tree as needed. a C 2 b a C 1 a b C 2 c C 1 d c d d 2 6
27 Proof of Theorem 7 (4 1) Let T be a Clique-Tree of graph G=(V,E) and V =k. Proof by induction: Assume the claim holds for all graphs of size < k. Let L be a leaf in T, and P its parent in T. Let v L\P (exists from maximality). v cannot be in any other clique. by Lemma 2, v is simplicial. 2 7
28 Proof of Theorem 7 (4 1) Let T be T with v removed. T is a Clique- Tree. By assumption G =(V\{v},E ) is chordal. By part 3 of Theorem 7, there exists σ, a Perfect Elimination Order for G. Let σ = [v, σ ] be a perfect elimination order for G. By the converse of part 3, we can conclude that G is chordal 2 8
29 PEO is a Key in designing algorithms and obtaining structural properties The following classical Graph Optimization problems are NP-Hard for general Graphs Finding (G) :clique number (the size of maximum size clique ) (G): Chromatic number ( minimum number of colors needed in a proper coloring of G) (G): independence number( maximum size of an independent set) (G): clique covering number ( minimum number of cliques needed to cover V(G) ) All these four problems can be solved in linear time in Chordal Graphs given a PEO as part of input 29
30 Polynomial Algorithms for chordal Graphs: Clique Number Given a PEO of a Chordal Graph G, maximum size clique can be found as follows: Let (v 1,v 2,,v n ) be a PEO of G. Define L(i)= maximum j, j > i such that v i v j E(G). F[i]=minimum j j >I such vivj isan edge. Let Max {L[i]-F[i]+1}=k=L[j]-F[j]+1. Then k= (G) and C={vj,vj+1,,v_{j+k-1}} is a maximum size clique. 30
31 Maximum Clique: Illustration L[1]=3,L[2]=4,L[3]=5,L[4]=5,L[5]=5. Max{L[i]-i+1}=3=L[1]-1+1=L[2]-2+1=L[3]-3+1. Maximum size cliques are {1,2,3},{2,3,4}, {3,4,5} 2 4 (1,2,3,4,5) is a PEO of G 1 G
32 Polynomial Algorithms for chordal graphs: chromatic number [Gavril 1972] Minimum-Coloring Algorithm Greedy Algorithm Scan the vertices in the reverse order of PEO and color each vertex with the smallest color not used among its successors Gives Optimal coloring Complexity = Polynomial (given that PEO is already known) 32
33 Minimum Coloring: Illustration C(1)=1,C(2)=2,C(3)=3,C(4)=1,C(5)=2 (G)= (5,4,3,2,1) is a PEO of G 1 G
34 Why optimal? Clearly, (G) (G) Let (v1,v2,,vn) be PEO. So (vn,,v2,v1) Is the reverse PEO. Now colorednbr(vi)= {vj vivj is an edge and j >i} (G) So (G) = (G) and hence Greedy algorithm is optimal. 34
35 Polynomial Algorithms for chordal graphs: Independence Number Maximum Independent Set Greedy algorithm Scan the vertices in the order of PEO, and for each v i, add v i to I if none of its predecessor has been added to I Complexity = O(n+m) Predecessor of v i is v j if j < i and v j v i E 35
36 Maximum Independent Set: Illustration I={1,4} 2 4 (1,2,3,4,5) is a PEO of G 1 G
37 Clique cover X i ={v j v i v j and j >i} y 1 =v 1 ; y i is the first vertex in which follows y i-1 and which is not in X 1 X 2 X i-1 ; all vertices following y t are in X 1 X 2 X t. Hence V={y 1,y 2, y t } X 1 X 2 X t. Theorem: {y 1,y 2, y t } is a maximum independent set and the collection of sets Y i ={y i } X i, 1 i t comprises a minimum clique cover of G. 37
38 Proof {y 1,y 2, y t } is an independent set as y i y j E(G) implies y j X i which is a contradiction. So (G) t. As Y i, 1 i t, is a clique cover of G. So (G) t. Hence (G) =t and the minimum clique cover contains at least t cliques. Hence the theorem. 38
39 Perfect Elimination Order (PEO) An ordered sequence of all vertices {V 1, V 2,, V n } Successor (V i ) = {V j: j>i and (i,j) ε E} Predecessor (V i ) = {V j : i>j and (i,j) ε E} Sequence of vertices such that for each vertex V i, successors of V i form a clique A graph is chordal if and only if it has a Perfect Elimination Order (PEO) [Fulkerson 1965] 39
40 Simplicial Vertex A vertex whose all neighbors form a clique Every chordal graph has at least one simplical vertex The first vertex in PEO is simplicial If you remove the simplicial vertex, then the graph induced by remaining nodes is also a chordal graph (hence must have a simplicial vertex of its own) 40
41 Simple method to find PEO Given G = (V, E) For (i=1 to N) { V i = Simplicial vertex (G); G = Graph induced by vertex set (V-V i ); } What if no simplicial vertex exists at some point? Complexity = O(N 4 ) 41
42 Finding a PEO (Maximum Cardinality Method) Rose and Tarjan [Rose 1975] Cardinality Number = Number of neighbors picked up Step1: Pick the node whose maximum number of neighbors have already been chosen Reverse the order Step 2: In the end, verify the ordering obtained is indeed PEO 42
43 Example Seq = 2 E (0) (1) F (0) (1) F (2) Seq = 6 Seq = 8 A(0) Seq =1 D(2) D(0) D(1) Seq =3 H (2) (3) (0) (1) Seq = 7 G(0) G(1) G(2) The PEO is: G, H, F, B, C, D, E, A B (2) B (3) B(0) (1) Seq = 5 C(0) C(1) C(2) Seq = 4 43
44 Observations 1. Except for the first node, any node being picked up has at least one neighbor which has already been picked 2. Set of picked nodes always form a connected graph 44
45 Proof of Correctness If a PEO does not exist, then algorithm does not generate a PEO If the PEO exists, then algorithm outputs some PEO 45
46 Proof of Correctness (Part 2) Let {V 1, V 2, V 3,,V i,, V j,, V k,,v n } be the ordering generated. Let V i is not in sequence. Then V j and V k be the two successors of V i that are not connected. Case 1: Then V j and V k are parts of two graphs which are connected only through V i The order in which the nodes were picked is: {V n,, V k,., V j,, V i,,v 3, V 2, V 1 } Then we claim that label sequence must have been different 46
47 Proof (Contd.) Case 2: Consider the path from k to j on which the nodes were picked up. All such nodes should be connected to i except those nodes, which are directly connected to j. Let m be such a vertex on that path. m must have some vertices which are not connected to i. 47
48 Proof (contd.) Let w be such a vertex. Therefore w must be connected to k. (through a path not involving i). If i is not connected to w, then we have a non chordal cycle i-k-w-m-j-i. i must be connected to w as well. Therefore there is no way that m can be picked before I since i is connected to one extra node than m (V k ) 48
49 Complexity Analysis (Step 2) Check if the generated ordering is perfect Trivial algorithm: Number of vertices whose successors have to be checked: N Time complexity to check if all the successors of a particular node are connected: N C 2 = N 2 Total complexity = N 3 49
50 Step 2: Efficient Implementation Efficient Way: Given ordering: {V 1, V 2, V 3,, V i,, V j,, V k,,v n } 1. for i = 1 to n do 2. if V i has successors 3. Let u be the first successor of V i 4. For all w Successor (V i ), w u 5. Add (u, w) to TEST 6. Test whether all vertex-pairs in TEST are adjacent. 50
51 Why? If the algorithm detects ordering as non-perfect, then ordering must be nonperfect If the algorithm detects ordering as PEO, then ordering cannot be imperfect (By contradiction) complexity if implemented carefully: O ( N + E) Maximum size of set TEST can be O(E) Instead of O (N 3 ) 51
52 Implementation of step 1 (generating perfect ordering) Trivial Method: Maintain a heap of cardinality numbers Complexity of each for loop: Find the maximum cardinality node and removing it: O(lg N) Number of updates for each node picked: N modifying the cardinality number and rearranging the heap: N lg N Total Complexity = N* (lg N + N lg N) = N 2 lg N Can also be shown as E lg N 52
53 Efficient Implementation (Step 1) With complexity O( N + E) For each node, maintain list of neighbors. (Already given in this format) Maintain linked list of vertices (in order of cardinality number) For each node, maintain its location in the linked list Picking the vertex with max. cardinality number = O(1) Finding all the neighbors and updating their cardinality number and their location in linked list = O(E) 53
54 Another definition for chordal graphs Intersection Graph: A graph that represents the intersection of sets Subtree Graph: Break a tree into multiple subtrees (overlapping) Now make a graph whose each vertex represents one subtree. An edge between two vertices if they have a common vertex (between the subtrees they represent) The graph thus obtained is known as Subtree Graph As [Gavril 1974] showed, the subtree graphs are exactly the chordal graphs. So a chordal graph can be represented as an intersection graph of subtrees. 54
55 Bibliography [Gavril 1974]: Gavril, Fănică, "The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B 16, 1974 [Gavril 1972]: Gavril, Algorithms for Minimum Coloring, Maximum Clique, Minimum Independent Set of a Chordal Graph, SIAM J. Comp., Vol 1, 1972 [Rose 1975]: Rose, Tarjan, Algorithmic Aspects of Vertex Elimination, Proc. 7 th annual ACM Symposium on Theory of Computing (STOC),
56 Bibliography [Arnborg 1989]: Arnborg et. al., Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics, Vol. 23, Issue 1, 1989 [Fulkerson 1965]: Fulkerson, D. R.; Gross, O. A. (1965). "Incidence matrices and interval graphs, Pacific J. Math 15: M.C.Golumbic Algorithmic Graph Theory and Perfect Graphs. Second edition 56
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv
Bayesian Networks, Winter 2009-2010 Yoav Haimovitch & Ariel Raviv 1 Chordal Graph Warm up Theorem 7 Perfect Vertex Elimination Scheme Maximal cliques Tree Bibliography M.C.Golumbic Algorithmic Graph Theory
More informationChordal graphs MPRI
Chordal graphs MPRI 2017 2018 Michel Habib habib@irif.fr http://www.irif.fr/~habib Sophie Germain, septembre 2017 Schedule Chordal graphs Representation of chordal graphs LBFS and chordal graphs More structural
More informationThese notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
More informationContracting Chordal Graphs and Bipartite Graphs to Paths and Trees
Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees Pinar Heggernes Pim van t Hof Benjamin Léveque Christophe Paul Abstract We study the following two graph modification problems: given
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
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 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 informationCharacterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
ISSN 0975-3303 Mapana J Sci, 11, 4(2012), 121-131 https://doi.org/10.12725/mjs.23.10 Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs R Mary Jeya Jothi * and A Amutha
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationNecessary edges in k-chordalizations of graphs
Necessary edges in k-chordalizations of graphs Hans L. Bodlaender Abstract In this note, we look at which edges must always be added to a given graph G = (V, E), when we want to make it a chordal graph
More informationNOTE ON MINIMALLY k-connected GRAPHS
NOTE ON MINIMALLY k-connected GRAPHS R. Rama a, Suresh Badarla a a Department of Mathematics, Indian Institute of Technology, Chennai, India ABSTRACT A k-tree is either a complete graph on (k+1) vertices
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationA taste of perfect graphs (continued)
A taste of perfect graphs (continued) Recall two theorems from last class characterizing perfect graphs (and that we observed that the α ω theorem implied the Perfect Graph Theorem). Perfect Graph Theorem.
More informationA NEW TEST FOR INTERVAL GRAPHS. Wen-Lian Hsu 1
A NEW TEST FOR INTERVAL GRAPHS Wen-Lian Hsu 1 Institute of Information Science, Academia Sinica Taipei, Taiwan, Republic of China hsu@iis.sinica.edu.tw Abstract An interval graph is the intersection graph
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 informationarxiv: v1 [math.co] 20 Nov 2018
A remark on the characterization of triangulated graphs arxiv:1811.08411v1 [math.co] 20 Nov 2018 R. GARGOURI a H. NAJAR b a Taibah University, College of Sciences, Department of Mathematics Madinah, Saudi
More informationTHE LEAFAGE OF A CHORDAL GRAPH
Discussiones Mathematicae Graph Theory 18 (1998 ) 23 48 THE LEAFAGE OF A CHORDAL GRAPH In-Jen Lin National Ocean University, Taipei, Taiwan Terry A. McKee 1 Wright State University, Dayton, OH 45435-0001,
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Abstract We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
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 informationSome results on Interval probe graphs
Some results on Interval probe graphs In-Jen Lin and C H Wu Department of Computer science Science National Taiwan Ocean University, Keelung, Taiwan ijlin@mail.ntou.edu.tw Abstract Interval Probe Graphs
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More informationParameterized coloring problems on chordal graphs
Parameterized coloring problems on chordal graphs Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary dmarx@cs.bme.hu
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationA TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX
A TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX MEHRNOUSH MALEKESMAEILI, CEDRIC CHAUVE, AND TAMON STEPHEN Abstract. A binary matrix has the consecutive ones property
More informationBlock Duplicate Graphs and a Hierarchy of Chordal Graphs
Block Duplicate Graphs and a Hierarchy of Chordal Graphs Martin Charles Golumbic Uri N. Peled August 18, 1998 Revised October 24, 2000 and March 15, 2001 Abstract A block graph is a graph whose blocks
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
More information7.3 Spanning trees Spanning trees [ ] 61
7.3. Spanning trees [161211-1348 ] 61 7.3 Spanning trees We know that trees are connected graphs with the minimal number of edges. Hence trees become very useful in applications where our goal is to connect
More informationGraphs and Discrete Structures
Graphs and Discrete Structures Nicolas Bousquet Louis Esperet Fall 2018 Abstract Brief summary of the first and second course. É 1 Chromatic number, independence number and clique number The chromatic
More informationLast course. Last course. Michel Habib 28 octobre 2016
Last course Michel Habib habib@irif.fr http://www.irif.fr/~habib 28 octobre 2016 Schedule Introduction More structural insights on chordal graphs Properties of reduced clique graphs Exercises Interval
More informationGraph Algorithms Using Depth First Search
Graph Algorithms Using Depth First Search Analysis of Algorithms Week 8, Lecture 1 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Graph Algorithms Using Depth
More informationGraph Definitions. In a directed graph the edges have directions (ordered pairs). A weighted graph includes a weight function.
Graph Definitions Definition 1. (V,E) where An undirected graph G is a pair V is the set of vertices, E V 2 is the set of edges (unordered pairs) E = {(u, v) u, v V }. In a directed graph the edges have
More informationAlgorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras
Algorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras What is it to be Perfect? Introduced by Claude Berge in early 1960s Coloring number and clique number are one and the same for all induced
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationEE512 Graphical Models Fall 2009
EE512 Graphical Models Fall 2009 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2009 http://ssli.ee.washington.edu/~bilmes/ee512fa09 Lecture 11 -
More informationMinimal comparability completions of arbitrary graphs
Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis Papadopoulos Abstract A transitive orientation of an undirected graph is an assignment of directions to its
More informationVertex coloring, chromatic number
Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if
More informationOn a perfect problem
R u t c o r Research R e p o r t On a perfect problem Igor E. Zverovich a RRR 26-2005, September 2005 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew Road Piscataway, New
More informationarxiv: v5 [math.co] 5 Oct 2017
Clique trees of infinite locally finite chordal graphs Christoph Hofer-Temmel and Florian Lehner arxiv:1311.7001v5 [math.co] 5 Oct 2017 Abstract We investigate clique trees of infinite locally finite chordal
More informationMinimal dominating sets in graph classes: combinatorial bounds and enumeration
Minimal dominating sets in graph classes: combinatorial bounds and enumeration Jean-François Couturier 1, Pinar Heggernes 2, Pim van t Hof 2, and Dieter Kratsch 1 1 LITA, Université Paul Verlaine - Metz,
More informationOn some subclasses of circular-arc graphs
On some subclasses of circular-arc graphs Guillermo Durán - Min Chih Lin Departamento de Computación Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires e-mail: {willy,oscarlin}@dc.uba.ar
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
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 informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationThe Disjoint Paths Problem on Chordal Graphs
The Disjoint Paths Problem on Chordal Graphs Frank Kammer and Torsten Tholey Institut für Informatik, Universität Augsburg, D-86135 Augsburg, Germany {kammer,tholey}@informatik.uni-augsburg.de Abstract.
More informationMaking arbitrary graphs transitively orientable: Minimal comparability completions
Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes Federico Mancini Charis Papadopoulos Abstract A transitive orientation of an undirected graph is an assignment
More informationApplied Mathematics Letters. Graph triangulations and the compatibility of unrooted phylogenetic trees
Applied Mathematics Letters 24 (2011) 719 723 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Graph triangulations and the compatibility
More informationarxiv: v1 [cs.ds] 8 Jan 2019
Subset Feedback Vertex Set in Chordal and Split Graphs Geevarghese Philip 1, Varun Rajan 2, Saket Saurabh 3,4, and Prafullkumar Tale 5 arxiv:1901.02209v1 [cs.ds] 8 Jan 2019 1 Chennai Mathematical Institute,
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
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 informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationVertex coloring, chromatic number
Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if
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 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 informationA Decomposition for Chordal graphs and Applications
A Decomposition for Chordal graphs and Applications Michel Habib Joint work with Vincent Limouzy and Juraj Stacho Pretty Structure, Existencial Polytime Jack Edmonds Birthday, 7-9 april 2009 Schedule Chordal
More informationRecognizing Interval Bigraphs by Forbidden Patterns
Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let
More informationMinimal Universal Bipartite Graphs
Minimal Universal Bipartite Graphs Vadim V. Lozin, Gábor Rudolf Abstract A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study
More informationFast Skew Partition Recognition
Fast Skew Partition Recognition William S. Kennedy 1, and Bruce Reed 2, 1 Department of Mathematics and Statistics, McGill University, Montréal, Canada, H3A2K6 kennedy@math.mcgill.ca 2 School of Computer
More informationSome new results on circle graphs. Guillermo Durán 1
Some new results on circle graphs Guillermo Durán 1 Departamento de Ingeniería Industrial, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago, Chile gduran@dii.uchile.cl Departamento
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationCSC 373: Algorithm Design and Analysis Lecture 4
CSC 373: Algorithm Design and Analysis Lecture 4 Allan Borodin January 14, 2013 1 / 16 Lecture 4: Outline (for this lecture and next lecture) Some concluding comments on optimality of EST Greedy Interval
More informationTree Decompositions, Treewidth, and NP-Hard Problems. A Survey Paper on Recent Findings in the Field. Gerrod Voigt
Tree Decompositions, Treewidth, and NP-Hard Problems A Survey Paper on Recent Findings in the Field Gerrod Voigt Mathematics Massachusetts Institute of Technology Abstract This survey paper provides an
More informationDynamic Distance Hereditary Graphs Using Split Decomposition
Dynamic Distance Hereditary Graphs Using Split Decomposition Emeric Gioan Christophe Paul LIRMM Research Report 07007 March 19, 2007 Abstract The problem of maintaining a representation of a dynamic graph
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
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 informationby conservation of flow, hence the cancelation. Similarly, we have
Chapter 13: Network Flows and Applications Network: directed graph with source S and target T. Non-negative edge weights represent capacities. Assume no edges into S or out of T. (If necessary, we can
More informationEnumeration of Perfect Sequences in Chordal Graphs
Enumeration of Perfect Sequences in Chordal Graphs Yasuko Matsui, Ryuhei Uehara, Takeaki Uno Center for Computational Epidemiology and Response Analysis University of North Texas May 4, 20 (CeCERA) GSCM
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationarxiv: v1 [math.co] 10 Oct 2017
The Overfull Conjecture on Split-Comparability Graphs Jadder B. de Sousa Cruz a, Cândida N. da Silva a,, Sheila M. de Almeida b arxiv:1710.03524v1 [math.co] 10 Oct 2017 Abstract a DComp-So ccgt ufscar
More informationComputing optimal total vertex covers for trees
Computing optimal total vertex covers for trees Pak Ching Li Department of Computer Science University of Manitoba Winnipeg, Manitoba Canada R3T 2N2 Abstract. Let G = (V, E) be a simple, undirected, connected
More informationClique trees of infinite locally finite chordal graphs
Clique trees of infinite locally finite chordal graphs Christoph Hofer-Temmel and Florian Lehner Abstract We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is
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 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 informationChordal Probe Graphs (extended abstract)
Chordal Probe Graphs (extended abstract) Martin Charles Golumbic Marina Lipshteyn Abstract. In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe
More informationRECOGNIZING CHORDAL PROBE GRAPHS AND CYCLE-BICOLORABLE GRAPHS
SIAM J. DISCRETE MATH. Vol. 21, No. 3, pp. 573 591 c 2007 Society for Industrial and Applied Mathematics RECOGNIZING CHORDAL PROBE GRAPHS AND CYCLE-BICOLORABLE GRAPHS ANNE BERRY, MARTIN CHARLES GOLUMBIC,
More informationA generalization of Mader s theorem
A generalization of Mader s theorem Ajit A. Diwan Department of Computer Science and Engineering Indian Institute of Technology, Bombay Mumbai, 4000076, India. email: aad@cse.iitb.ac.in 18 June 2007 Abstract
More informationOn the correspondence between tree representations of chordal and dually chordal graphs
On the correspondence between tree representations of chordal and dually chordal graphs Pablo De Caria, Marisa Gutierrez CONICET/ Departamento de Matemática, Universidad Nacional de La Plata, Calle 50
More informationMaximal Label Search algorithms to compute perfect and minimal elimination orderings
Author manuscript, published in "SIAM Journal on Discrete Mathematics 23, 1 (2009) 428-446" Maximal Label Search algorithms to compute perfect and minimal elimination orderings A. Berry R. Krueger G. Simonet
More informationApproximation slides 1. An optimal polynomial algorithm for the Vertex Cover and matching in Bipartite graphs
Approximation slides 1 An optimal polynomial algorithm for the Vertex Cover and matching in Bipartite graphs Approximation slides 2 Linear independence A collection of row vectors {v T i } are independent
More informationAdvanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.
18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationAn O(m + nlog n) On-Line Algorithm for Recognizing Interval Graphs
An O(m + nlog n) On-Line Algorithm for Recognizing Interval Graphs Wen-Lian Hsu Institute of Information Science, Academia Sinica, Taipei, Taiwan, R.O.C. Abstract. Since the invention of PQ-trees by Booth
More informationPrice of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
Price of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs Eglantine Camby Université Libre de Bruxelles, Brussels, Belgium GERAD
More informationGraph Theory. Probabilistic Graphical Models. L. Enrique Sucar, INAOE. Definitions. Types of Graphs. Trajectories and Circuits.
Theory Probabilistic ical Models L. Enrique Sucar, INAOE and (INAOE) 1 / 32 Outline and 1 2 3 4 5 6 7 8 and 9 (INAOE) 2 / 32 A graph provides a compact way to represent binary relations between a set of
More informationAcyclic Edge Colorings of Graphs
Acyclic Edge Colorings of Graphs Noga Alon Ayal Zaks Abstract A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G,
More informationDeciding k-colorability of P 5 -free graphs in polynomial time
Deciding k-colorability of P 5 -free graphs in polynomial time Chính T. Hoàng Marcin Kamiński Vadim Lozin Joe Sawada Xiao Shu April 16, 2008 Abstract The problem of computing the chromatic number of a
More informationSkew partitions in perfect graphs
Discrete Applied Mathematics 156 (2008) 1150 1156 www.elsevier.com/locate/dam Skew partitions in perfect graphs Bruce Reed a,b a McGill University, Montreal, Canada b CNRS, France Received 14 June 2005;
More informationMinimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes
Minimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes J.-F. Couturier 1 P. Heggernes 2 D. Kratsch 1 P. van t Hof 2 1 LITA Université de Lorraine F-57045 Metz France 2 University
More informationCOMP260 Spring 2014 Notes: February 4th
COMP260 Spring 2014 Notes: February 4th Andrew Winslow In these notes, all graphs are undirected. We consider matching, covering, and packing in bipartite graphs, general graphs, and hypergraphs. We also
More informationProblem Set 2 Solutions
Problem Set 2 Solutions Graph Theory 2016 EPFL Frank de Zeeuw & Claudiu Valculescu 1. Prove that the following statements about a graph G are equivalent. - G is a tree; - G is minimally connected (it is
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
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 informationProbe Distance-Hereditary Graphs
Proc. 16th Computing: The Australasian Theory Symposium (CATS 2010), Brisbane, Australia Probe Distance-Hereditary Graphs Maw-Shang Chang 1 Ling-Ju Hung 1 Peter Rossmanith 2 1 Department of Computer Science
More informationApplied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap
Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University
More informationMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free
More informationThe NP-Completeness of Some Edge-Partition Problems
The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006
More informationCLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN
CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.
More informationUnit 8: Coping with NP-Completeness. Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems. Y.-W.
: Coping with NP-Completeness Course contents: Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems Reading: Chapter 34 Chapter 35.1, 35.2 Y.-W. Chang 1 Complexity
More information