Graph-Theoretic Algorithms

Total Page:16

File Type:pdf, Size:1020Kb

Graph-Theoretic Algorithms CS762: Graph-Theoretic Algorithms Felix Zhou Spring 2020, University of Waterloo from Professor Therese Biedl’s Lectures 2 Contents 1 Introduction 13 1.1 Motivation . 13 1.1.1 Points of Inquisition . 13 1.2 Graph Assumptions . 13 1.3 Weighted Dominating Set in Paths . 14 I Planar Graphs 15 2 Planar Graphs 17 2.1 Definitions . 17 2.1.1 Planar Drawing . 17 2.1.2 Planar Embedding . 18 2.1.3 Multiple Planar Embeddings . 19 2.2 Exploting the Planar Embedding . 19 2.2.1 Right-First Search . 19 2.2.2 The Menger Problem in st-planar graphs . 21 Pseudocode . 21 Analysis . 21 2.3 Dual Graphs . 21 2.3.1 Computing & Storing G∗ ........................ 22 2.3.2 Algorithmic Implications . 23 3 2.4 Euler’s Formula . 23 2.4.1 Algorithmic Implications . 24 Colouring . 25 Testing Adjacency . 25 Clique . 25 3 Problems in Planar Graphs 27 3.1 NP-Hard Problems in Planar Graphs . 27 3.1.1 Coloring . 27 3-Coloring Reduction . 28 3.1.2 Planar 3-SAT . 28 3.1.3 Independent Set . 29 Planar Reduction . 30 3.2 Maximum-Flow . 31 3.2.1 st-Cuts . 31 3.2.2 Undirected Flow in st-Planar Graphs . 32 Restricting to st-Planar Graphs . 32 4 Planarity Testing 37 4.1 Bush Forms . 37 4.2 The Algorithm by Haeupler & Tarjan . 38 4.2.1 Depth-First Search & Bush Forms . 38 4.2.2 High-Level Idea . 40 4.2.3 PQ-Trees . 40 Reductions . 41 4.2.4 Data Structures . 41 Descendants Consisting of Finished Children . 42 The Active Child . 42 4 4.2.5 Summary . 42 Initialization . 42 Tree Edge Update . 43 None-Tree Edge Update . 43 Tree Edge Retreat Update . 43 4.2.6 Final Thoughts . 44 5 Triangulated Graphs 45 5.1 Maximal Planar Graphs . 45 5.2 Related Graph Classes . 46 5.3 Canonical Ordering . 47 5.3.1 Properties . 48 5.3.2 Existence of the Canonical Order . 49 5.3.3 Splitting into Trees . 50 Arboricity . 51 5.3.4 Visibility Representation . 51 5.3.5 Straight-Line Embeddings . 53 6 Friends of Planar Graphs 55 6.1 Super Classes of Planar Graphs . 55 6.1.1 Graphs in 3D . 55 6.1.2 Graphs of Bounded Genus . 56 6.1.3 Near Planar Graphs . 56 6.2 Subclasses of Planar Graphs . 57 6.2.1 Trees . 57 6.2.2 Outer-Planar Graphs . 57 Maximal Outer-Planar Graphs . 58 Problems . 59 5 6.2.3 k-Outer-Planar Graphs . 59 6.2.4 Series-Parallel Graphs . 60 6.2.5 2-Terminal Series-Parallel Graphs . 60 The SP-Tree . 60 SP-Graphs . 61 6.2.6 Apollonion Networks . 61 6.2.7 Relationships between Subclasses of Planar Graphs . 62 II From Interval Graphs to Treewidth 63 7 Interval Graphs & Friends 65 7.1 Interval Graphs . 65 7.2 Chordal Graphs . 66 7.3 Perfect Elimination Order . 66 7.4 Problems in Chordal Graphs . 67 7.4.1 Coloring . 67 7.4.2 Clique . 68 7.4.3 Independent Set . 68 7.4.4 Dominating Set . 68 7.5 Friends of Interval Graphs . 69 7.5.1 Intersection Graphs . 69 7.5.2 H-Free Graphs . 70 7.5.3 Perfect Graphs . 70 8 Recognizing Chordal Graphs & Interval Graphs 71 8.1 Finding a Perfect Elimination Order . 71 8.1.1 Finding Simplicial Vertices . 71 8.1.2 Maximum Cardinality Search . 72 6 8.1.3 Lexicographic BFS . 74 8.2 Testing a Putative Perfect Elmination Order . 74 8.2.1 An Idea . 74 8.3 Recognizing Interval Graphs . 75 8.3.1 PQ-Trees . 78 8.3.2 Other Algorithms . 79 9 Tree Decompositions 81 9.1 Strong Path Decomposition . 81 9.2 Strong Tree Decomposition . 81 9.2.1 Perfect Elimination Orders & Tree Decompositions . 83 10 Treewidth 87 10.1 k-Trees . 87 10.1.1 Properties of k-Trees . 88 10.1.2 Planar k-Trees . 88 10.2 Partial k-Trees . 89 10.3 Treewidth . 91 10.3.1 Properties of the Treewidth . 92 10.3.2 Graphs with Big Treewidth . 93 10.3.3 Series-Parallel Graphs . 93 SP-Graphs & Treewidth . 94 Recognizing SP-Graphs . 94 11 Branchwidth 97 11.1 e-Separations & Branch Decompositions . 97 11.2 Branchwidth & Treewidth . 99 11.3 Branch Decomposition of Planar Graphs . 100 11.3.1 Spanning Trees of Small Height . 101 7 12 Pathwidth 105 12.1 Path Decomposition . ..
Recommended publications
  • On Treewidth and Graph Minors
    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
    [Show full text]
  • Lecture 10: April 20, 2005 Perfect Graphs
    Re-revised notes 4-22-2005 10pm CMSC 27400-1/37200-1 Combinatorics and Probability Spring 2005 Lecture 10: April 20, 2005 Instructor: L´aszl´oBabai Scribe: Raghav Kulkarni TA SCHEDULE: TA sessions are held in Ryerson-255, Monday, Tuesday and Thursday 5:30{6:30pm. INSTRUCTOR'S EMAIL: [email protected] TA's EMAIL: [email protected], [email protected] IMPORTANT: Take-home test Friday, April 29, due Monday, May 2, before class. Perfect Graphs k 1=k Shannon capacity of a graph G is: Θ(G) := limk (α(G )) : !1 Exercise 10.1 Show that α(G) χ(G): (G is the complement of G:) ≤ Exercise 10.2 Show that χ(G H) χ(G)χ(H): · ≤ Exercise 10.3 Show that Θ(G) χ(G): ≤ So, α(G) Θ(G) χ(G): ≤ ≤ Definition: G is perfect if for all induced sugraphs H of G, α(H) = χ(H); i. e., the chromatic number is equal to the clique number. Theorem 10.4 (Lov´asz) G is perfect iff G is perfect. (This was open under the name \weak perfect graph conjecture.") Corollary 10.5 If G is perfect then Θ(G) = α(G) = χ(G): Exercise 10.6 (a) Kn is perfect. (b) All bipartite graphs are perfect. Exercise 10.7 Prove: If G is bipartite then G is perfect. Do not use Lov´asz'sTheorem (Theorem 10.4). 1 Lecture 10: April 20, 2005 2 The smallest imperfect (not perfect) graph is C5 : α(C5) = 2; χ(C5) = 3: For k 2, C2k+1 imperfect.
    [Show full text]
  • Arxiv:2106.16130V1 [Math.CO] 30 Jun 2021 in the Special Case of Cyclohedra, and by Cardinal, Langerman and P´Erez-Lantero [5] in the Special Case of Tree Associahedra
    LAGOS 2021 Bounds on the Diameter of Graph Associahedra Jean Cardinal1;4 Universit´elibre de Bruxelles (ULB) Lionel Pournin2;4 Mario Valencia-Pabon3;4 LIPN, Universit´eSorbonne Paris Nord Abstract Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph G encodes the combinatorics of search trees on G, defined recursively by a root r together with search trees on each of the connected components of G − r. In particular, the skeleton of the graph associahedron is the rotation graph of those search trees. We investigate the diameter of graph associahedra as a function of some graph parameters. It is known that the diameter of the associahedra of paths of length n, the classical associahedra, is 2n − 6 for a large enough n. We give a tight bound of Θ(m) on the diameter of trivially perfect graph associahedra on m edges. We consider the maximum diameter of associahedra of graphs on n vertices and of given tree-depth, treewidth, or pathwidth, and give lower and upper bounds as a function of these parameters. Finally, we prove that the maximum diameter of associahedra of graphs of pathwidth two is Θ(n log n). Keywords: generalized permutohedra, graph associahedra, tree-depth, treewidth, pathwidth 1 Introduction The vertices and edges of a polyhedron form a graph whose diameter (often referred to as the diameter of the polyhedron for short) is related to a number of computational problems. For instance, the question of how large the diameter of a polyhedron arises naturally from the study of linear programming and the simplex algorithm (see, for instance [27] and references therein).
    [Show full text]
  • The Strong Perfect Graph Theorem
    Annals of Mathematics, 164 (2006), 51–229 The strong perfect graph theorem ∗ ∗ By Maria Chudnovsky, Neil Robertson, Paul Seymour, * ∗∗∗ and Robin Thomas Abstract A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu´ejols and Vuˇskovi´c — that every Berge graph either falls into one of a few basic classes, or admits one of a few kinds of separation (designed so that a minimum counterexample to Berge’s conjecture cannot have either of these properties). In this paper we prove both of these conjectures. 1. Introduction We begin with definitions of some of our terms which may be nonstandard. All graphs in this paper are finite and simple. The complement G of a graph G has the same vertex set as G, and distinct vertices u, v are adjacent in G just when they are not adjacent in G.Ahole of G is an induced subgraph of G which is a cycle of length at least 4. An antihole of G is an induced subgraph of G whose complement is a hole in G. A graph G is Berge if every hole and antihole of G has even length. A clique in G is a subset X of V (G) such that every two members of X are adjacent.
    [Show full text]
  • Results on Independent Sets in Categorical Products of Graphs, The
    Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio Wing-Kai Hon1, Ton Kloks, Hsiang-Hsuan Liu1, Sheung-Hung Poon1, and Yue-Li Wang2 1 Department of Computer Science National Tsing Hua University, Taiwan {wkhon,hhliu,spoon}@cs.nthu.edu.tw 2 Department of Information Management National Taiwan University of Science and Technology [email protected] Abstract. We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a k k graph G is defined as limk→ α(G )/n . The ultimate categorical inde- pendence ratio is polynomial for cographs, permutation graphs, interval graphs, graphs of bounded treewidth∞ and splitgraphs. When G is a planar graph of maximal degree three then α(G K4) is NP-complete. We present a PTAS for the ultimate categorical independence× ratio of planar graphs. We present an O∗(nn/3) exact, exponential algorithm for general graphs. We prove that the ultimate categorical independent domination ratio for complete multipartite graphs is zero, except when the graph is complete bipartite with color classes of equal size (in which case it is1/2). 1 Introduction Let G and H be two graphs. The categorical product also travels under the guise of tensor product, or direct product, or Kronecker product, and even more names arXiv:1306.1656v1 [cs.DM] 7 Jun 2013 have been given to it. It is defined as follows. It is a graph, denoted as G H.
    [Show full text]
  • Ma/CS 6B Class 8: Planar and Plane Graphs
    1/26/2017 Ma/CS 6b Class 8: Planar and Plane Graphs By Adam Sheffer The Utilities Problem Problem. There are three houses on a plane. Each needs to be connected to the gas, water, and electricity companies. ◦ Is there a way to make all nine connections without any of the lines crossing each other? ◦ Using a third dimension or sending connections through a company or house is not allowed. 1 1/26/2017 Rephrasing as a Graph How can we rephrase the utilities problem as a graph problem? ◦ Can we draw 퐾3,3 without intersecting edges. Closed Curves A simple closed curve (or a Jordan curve) is a curve that does not cross itself and separates the plane into two regions: the “inside” and the “outside”. 2 1/26/2017 Drawing 퐾3,3 with no Crossings We try to draw 퐾3,3 with no crossings ◦ 퐾3,3 contains a cycle of length six, and it must be drawn as a simple closed curve 퐶. ◦ Each of the remaining three edges is either fully on the inside or fully on the outside of 퐶. 퐾3,3 퐶 No 퐾3,3 Drawing Exists We can only add one red-blue edge inside of 퐶 without crossings. Similarly, we can only add one red-blue edge outside of 퐶 without crossings. Since we need to add three edges, it is impossible to draw 퐾3,3 with no crossings. 퐶 3 1/26/2017 Drawing 퐾4 with no Crossings Can we draw 퐾4 with no crossings? ◦ Yes! Drawing 퐾5 with no Crossings Can we draw 퐾5 with no crossings? ◦ 퐾5 contains a cycle of length five, and it must be drawn as a simple closed curve 퐶.
    [Show full text]
  • Planarity and Duality of Finite and Infinite Graphs
    JOURNAL OF COMBINATORIAL THEORY, Series B 29, 244-271 (1980) Planarity and Duality of Finite and Infinite Graphs CARSTEN THOMASSEN Matematisk Institut, Universitets Parken, 8000 Aarhus C, Denmark Communicated by the Editors Received September 17, 1979 We present a short proof of the following theorems simultaneously: Kuratowski’s theorem, Fary’s theorem, and the theorem of Tutte that every 3-connected planar graph has a convex representation. We stress the importance of Kuratowski’s theorem by showing how it implies a result of Tutte on planar representations with prescribed vertices on the same facial cycle as well as the planarity criteria of Whit- ney, MacLane, Tutte, and Fournier (in the case of Whitney’s theorem and MacLane’s theorem this has already been done by Tutte). In connection with Tutte’s planarity criterion in terms of non-separating cycles we give a short proof of the result of Tutte that the induced non-separating cycles in a 3-connected graph generate the cycle space. We consider each of the above-mentioned planarity criteria for infinite graphs. Specifically, we prove that Tutte’s condition in terms of overlap graphs is equivalent to Kuratowski’s condition, we characterize completely the infinite graphs satisfying MacLane’s condition and we prove that the 3- connected locally finite ones have convex representations. We investigate when an infinite graph has a dual graph and we settle this problem completely in the locally finite case. We show by examples that Tutte’s criterion involving non-separating cy- cles has no immediate extension to infinite graphs, but we present some analogues of that criterion for special classes of infinite graphs.
    [Show full text]
  • On the Treewidth of Triangulated 3-Manifolds
    On the Treewidth of Triangulated 3-Manifolds Kristóf Huszár Institute of Science and Technology Austria (IST Austria) Am Campus 1, 3400 Klosterneuburg, Austria [email protected] https://orcid.org/0000-0002-5445-5057 Jonathan Spreer1 Institut für Mathematik, Freie Universität Berlin Arnimallee 2, 14195 Berlin, Germany [email protected] https://orcid.org/0000-0001-6865-9483 Uli Wagner Institute of Science and Technology Austria (IST Austria) Am Campus 1, 3400 Klosterneuburg, Austria [email protected] https://orcid.org/0000-0002-1494-0568 Abstract In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how “simple” or “thin” a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic problems; in particular, there is a variety of problems in computational 3-manifold topology – some of them known to be computationally hard in general – that become solvable in polynomial time as soon as the dual graph of the input triangulation has bounded treewidth. In view of these algorithmic results, it is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth. We show that this is not the case, i.e., that there exists an infinite family of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth (the latter implies the former, but we present two separate proofs). We derive these results from work of Agol and of Scharlemann and Thompson, by exhibiting explicit connections between the topology of a 3-manifold M on the one hand and width-type parameters of the dual graphs of triangulations of M on the other hand, answering a question that had been raised repeatedly by researchers in computational 3-manifold topology.
    [Show full text]
  • 5 Graph Theory
    last edited March 21, 2016 5 Graph Theory Graph theory – the mathematical study of how collections of points can be con- nected – is used today to study problems in economics, physics, chemistry, soci- ology, linguistics, epidemiology, communication, and countless other fields. As complex networks play fundamental roles in financial markets, national security, the spread of disease, and other national and global issues, there is tremendous work being done in this very beautiful and evolving subject. The first several sections covered number systems, sets, cardinality, rational and irrational numbers, prime and composites, and several other topics. We also started to learn about the role that definitions play in mathematics, and we have begun to see how mathematicians prove statements called theorems – we’ve even proven some ourselves. At this point we turn our attention to a beautiful topic in modern mathematics called graph theory. Although this area was first introduced in the 18th century, it did not mature into a field of its own until the last fifty or sixty years. Over that time, it has blossomed into one of the most exciting, and practical, areas of mathematical research. Many readers will first associate the word ‘graph’ with the graph of a func- tion, such as that drawn in Figure 4. Although the word graph is commonly Figure 4: The graph of a function y = f(x). used in mathematics in this sense, it is also has a second, unrelated, meaning. Before providing a rigorous definition that we will use later, we begin with a very rough description and some examples.
    [Show full text]
  • SELF-DUAL GRAPHS 1. Self-Duality of Graphs 1.1. Forms of Self
    SELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS Abstract. We consider the three forms of self-duality that can be exhibited by a planar graph G, map self-duality, graph self-duality and matroid self- duality. We show how these concepts are related with each other and with the connectivity of G. We use the geometry of self-dual polyhedra together with the structure of the cycle matroid to construct all self-dual graphs. 1. Self-Duality of Graphs 1.1. Forms of Self-duality. Given a planar graph G = (V, E), any regular em- bedding of the topological realization of G into the sphere partitions the sphere into regions called the faces of the embedding, and we write the embedded graph, called a map, as M = (V, E, F ). G may have loops and parallel edges. Given a map M, we form the dual map, M ∗ by placing a vertex f ∗ in the center of each face f, and for ∗ each edge e of M bounding two faces f1 and f2, we draw a dual edge e connecting ∗ ∗ the vertices f1 and f2 and crossing e once transversely. Each vertex v of M will then correspond to a face v∗ of M ∗ and we write M ∗ = (F ∗,E∗,V ∗). If the graph G has distinguishable embeddings, then G may have more than one dual graph, see Figure 1. In this example a portion of the map (V, E, F ) is flipped over on a Q ¡@A@ ¡BB Q ¡ sA @ ¡ sB QQ ¨¨ HH H ¨¨PP ¨¨ ¨ H H ¨ H@ HH¨ @ PP ¨ B¨¨ HH HH HH ¨¨ ¨¨ H HH H ¨¨PP ¨ @ Hs ¨s @¨c H c @ Hs ¢¢ HHs @¨c P@Pc¨¨ s s c c c c s s c c c c @ A ¡ @ A ¢ @s@A ¡ s c c @s@A¢ s c c ∗ ∗ ∗ ∗ 0 ∗ 0∗ ∗ ∗ (V, E,s F ) −→ (F ,E ,V ) (V, E,s F ) −→ (F ,E ,V ) Figure 1.
    [Show full text]
  • Master's Thesis
    Master's thesis BWO: Wiskunde∗ A search for the regular tessellations of closed hyperbolic surfaces Student: Benny John Aalders 1st supervisor: Prof. dr. Gert Vegter 2nd supervisor: Dr. Alef Sterk 31st August 2017 ∗Part of the master track: Educatie en Communicatie in de Wiskunde en Natuur- wetenschappen Abstract In this thesis we study regular tessellations of closed orientable surfaces of genus 2 and higher. We differentiate between a purely topological setting and a metric setting. In the topological setting we will describe an algorithm that finds all possible regular tessellations. We also provide the output of this algorithm for genera 2 up to and including 10. In the metric setting we will prove that all topological regular tessellations can be realized metrically. Our method provides an alternative to that of Edmonds, Ewing and Kulkarni. Contents 1 Introduction 1 2 Preliminaries 2 2.1 Hyperbolic geometry . .2 2.2 Fundamental domains . .3 2.3 Side pairings . .4 2.4 A brief discussion on Poincar´e'sTheorem . .5 2.5 Riemann Surfaces . .6 2.6 Tessellations . .9 3 Tessellations of a closed orientable genus-2+ surface 14 3.1 Tessellations of a closed orientable genus-2+ surface consisting of one tile . 14 3.2 How to represent a closed orientable genus-2+ surface as a poly- gon. 16 3.3 Find all regular tessellations of a closed orientable genus-2+ surface 17 4 Making metric regular tessellations out of topological regular tessellations 19 4.1 Exploring the possibilities . 19 4.2 Going from topologically regular to metrically regular . 21 Appendices A An Octave script that prints what all possible fp; qg tessellations for some closed orientable genus-g surface are into a file 28 B All regular tessellations of closed orientable surfaces of genus 2 to 10 33 References 52 1 Introduction In this thesis we will show how to find all possible regular tessellations of a genus-g surface, where g ≥ 2 (genus-2+ surfaces for short).
    [Show full text]
  • Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic
    Wright State University CORE Scholar Mathematics and Statistics Faculty Publications Mathematics and Statistics 9-2002 Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic Dan Slilaty Wright State University - Main Campus, [email protected] Follow this and additional works at: https://corescholar.libraries.wright.edu/math Part of the Applied Mathematics Commons, Applied Statistics Commons, and the Mathematics Commons Repository Citation Slilaty, D. (2002). Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic. Combinatorics Probability & Computing, 11 (5), 515-528. https://corescholar.libraries.wright.edu/math/23 This Article is brought to you for free and open access by the Mathematics and Statistics department at CORE Scholar. It has been accepted for inclusion in Mathematics and Statistics Faculty Publications by an authorized administrator of CORE Scholar. For more information, please contact [email protected]. Combinatorics, Probability and Computing (2002) 11, 515–528. c 2002 Cambridge University Press DOI: 10.1017/S0963548302005278 Printed in the United Kingdom Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic DANIEL C. SLILATY Department of Mathematics and Statistics, Wright State University, Dayton, OH 45435, USA (e-mail: [email protected]) Received 13 June 2001; revised 11 February 2002 Let G be a connected graph that is 2-cell embedded in a surface S, and let G∗ be its topological dual graph. We will define and discuss several matroids whose element set is E(G), for S homeomorphic to the plane, projective plane, or torus. We will also state and prove old and new results of the type that the dual matroid of G is the matroid of the topological dual G∗.
    [Show full text]