DOCSLIB.ORG

Uniform Planar Embedding Is Np-Complete*

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Uniform Planar Embedding Is Np-Complete* Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206 August, 1990 UNIFORM PLANAR EMBEDDING IS NP-COMPLETE* MATTHIAS F.M. STALLMANN Key Words. planar graphs, book embedding, NP-completeness. An instance of the uniform planar embedding (UPE) problem is described by giving a (planar) graph G = (V, E) and a set of uniformity constraints of the form (v : el.. .ed,w : fl . fd), where {el,. ,ed} is the set of edges incident on vertex v and {fl,. ,fd} the set incident on w -f- v (v and w must have the same degree). A positive instance is one in which G has a planar embedding that satisfies all uniformity constraints, that is, for each constraint the cyclic permutation of el.. ed around v is the same as that of fl . .Aaround w. Uniformity constraints arise in VLSI design applications, where, in a hierarchical design, modules of the same type are required to observe the same pin order. The usual method for enforcing this constraint is to fix the pin order for all modules before doing the layout. The resulting single-layer routing problem can be solved easily in linear time [5],but puts unnecessary restrictions on the layout. UPE is a more general formulation of sin,gle-layerrouting, which does not impose pin order in advance. Single layer routing pro L lems are important for two reasons: a) one layer, typically metal, may have superior electrical characteristics, making it desirable to place all important connections on this layer, or b) a multi-layer problem may be decomposed into single layers in order to make it more tractable. Consider the single-layer routing problem shown in Figure 1, where x, y, and z are three modules of the same type. If the fixed pin sequence 1,2,3,4 is enforced, as in [5], it is easy to show that there is no planar embedding for the desired interconnections. Figure 2 shows an embedding in which x, y, and 2 observe the same pin sequence. The corresponding (positive) instance of UPE is given by the graph in Figure 3 (note: multiple edges are allowed), and the two uniformity constraints (x : abed, y : e fdc) and (x : abed, z: ebfa). This note shows that the UPE problem is NP-complete in general, complementing another recent result, that UPE can be solved in polynomial time as long as the number of biconnected components of G is fixed [7]. * written August 6, 1990 The use of UPE in hierarchical layout problems is a strengthening of the notion of strong planarity as proposed by Lengauer [4]. Strong planarity only requires that the pins of each module be on the external face when the module is embedded, while UPE also requires that two modules of the same type have their pins embedded in the same sequence around that face. In order to prove the main result, we first introduce a restricted book embedding problem that reduces to UPE. Book embedding, introduced by Bernhart and Kainen [I],may be formulated as follows: Given a graph G = (V, E), where V = {O, . ,n - I}, and a pagenumber k, does there exist a partition of E = (El,. , Ek) and a (cyclic) permutation v of V, so that G+ (V, Ei U C), where C = {{~(i),v(i + 1 mod n)} 1 0 < i < n - I}, is outerplanar for 1 < )< k? Book embedding is NP-complete even if G is planar and k is 2 [9]. An instance of the fixed-partition book embedding (ME) problem is an instance of book embedding in which E = (El,.. , Ek) is specified. We show that FPBE is NP-complete and that FPBE reduces to UPE. It is interesting to note that when the permutation v (but not the partition) is fixed, book embedding becomes circle graph k-coloring, which is NP-complete for fixed k 2 4 [8] (k = 2 is trivial and k = 3 is still open). LEMMA1. FPBE is NP-complete. Proof. FPBE is clearly in NP. We give a reduction from the non-betweenness (NB) problem to FPBE, where NB is defined as follows: Given a set {ao,.. ,an_l} and a list of constraints Cl, . , Cm, where each constraint has the form (ai,ajak), meaning a; does not occur between a, and ah, is there a permutation TT such that the sequence an(o).. ar(n-l) satisfies all the constraints? NP-completeness of NB follows easily from that of BETWEENNESS, as defined in [3] (the NP-completeness proof for BETWEENNESS is found in [6]; the statement and proof for NB is found in [2]). From an instance (ao,. , an-l; Cl,. .,ern) of NB, construct a graph G = (V, E) as follows. V = {ao,. ,an-l} U {x}, where x $ {ao,. ,a,,-I}, and E = El U . U Era,where E = {{six}, {ai, a^}}, given that Cv = (a,, ajat). It is easy to see that a permutation arp) . air(n-l)satisfies all constraints if and only if xar(~). a+-l) can be formed into a cycle so that for each p, the edges of Ep can be embedded on the same side of the cycle. This is equivalent to saying that the instance of NB is positive if and only if the instance of FPBE defined by G and E = (El,.. ,Em)is positive. 0 THEOREM2. UPE is NP-complete. Proof. UPE is clearly in NP, and, because of Lemma 1, it suffices to reduce FPBE to UPE. Given an FPBE problem on G = (V, E) with pagenumber k, we can define a planar graph G" = (V", E") and a set of uniformity constraints C relating vertices in V" so that G has a book embedding with respect to (El,. , Ek)if and only if G" has a uniform embedding with respect to constraint set C. For j = 1,.. , k let V" = {q} U {wi,, 1 i E V} and Ej'= {e;, = {v,,wi,j} \ i E V} U {{w;,,,, wi2,,} ] {il, ;^} E Ej}. Now let G" be the disjoint union of components Gp((V,, Ey). Let Figure 4 shows G and a partition of E into two layers for a typical FPBE problem. Figure 5 shows the resulting GI1. 0 The graph G in the reduction of Theorem 2 has multiple connected components, but could easily be modified to have a single connected component. It could not be modified to have any fixed number of biconnected components, however, beca,use of the results described in [7]. REFERENCES [I] F. BERNHARTAND B. KAINEN,The book thickness of a graph, Journal of Combinatorial Theory UP. - B,. 27 (1979).~ ,. .- 320 331. [2] D. BOVETAND A. PANCONESI,Inclusion relationships among permutation problems, Discrete Applied Mathematics, 16 (1987), pp. 113 - 123. [3] M. R. GAREYAND D. S. JOHNSON,Computers and Intractability: A Guide to the Th,eory of NP-Completeness, W.H. Freeman, 1979. [4] T. LENGAUER,Hierarchical planarity testing algorithms, in Automata, Languages, and Program- ming: 13th ICALP, Lecture Notes in Computer Science 226, Springer Verlag, 1986, pp. 215 - 225. [a] M. MAREK-SADOWSKAAND T.-K. TARNG,Single-layer routing for VLSI: Analysis and algo- rithms, IEEE Transactions on Computer Aided Design, CAD-2 (1983), pp. 246 - 259. [6] J. OPATRNY,Total ordering problem, SIAM Journal on Computing, 8 (1979), pp. 111-114. [7] M. STALLMANN,Constrained planar embedding problems, in Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing, 1989, pp. 58 - 67. [8] W. UNGER,On the k-colouring of circle graphs, in Proceedings 5th Annual Symposium on Theo- retical Aspects of Computer Science, 1988, pp. 61 - 72. 9 A. WIGDERSON, The complexity of the Hamiltonian circuit problem for maximal planar graphs, Tech. Rep. 298, EECS Department, Princeton University, 1982. z pin 4 (a) z pin 2 (6) Y pin 4 (c) Y pin 3 (4 pin pin. pin pin x pin 2 (6) Y pin 2 (f1 x pin 1 (a) FIG.1. A single-layer routing problem FIG. 2. Uniform solution to routing problem 2. 3. Graph corresponding to the routing probleni E2 FIG.4. A fixed-partition book embedding problem 6 FIG. 5. Graph for UPE problem corresponding to the FPBE problem .
Load more

Recommended publications
  • BOOK EMBEDDINGS of LAMAN GRAPHS 1. Definitions Definition 1
    BOOK EMBEDDINGS OF LAMAN GRAPHS MICHELLE DELCOURT, MEGHAN GALIARDI, AND JORDAN TIRRELL Abstract. We explore various techniques to embed planar Laman graphs in books. These graphs can be embedded as pointed pseudo-triangulations and have many interesting properties. We conjecture that all planar Laman graphs can be embedded in two pages. 1. Definitions Definition 1. A graph G with n vertices and m edges is a Laman graph if m = 2n − 3 and every subgraph induced by k vertices (where k > 1) contains at most 2k − 3 edges. Definition 2. A book embedding of a graph G is a drawing with no crossings of G on a book; every edge is mapped to a page (a half-plane), and every vertex is mapped to the spine (the boundary shared by all the half-planes). Definition 3. The book thickness of a graph G, denoted bt(G) also known as page number, is the minimum number of pages needed to book embed G. 2. Finding Book Thickness Using Henneberg Constructions Motivated by Schnyder labelings for triangulations, Huemer and Kappes proposed an analogous binary labeling for quadrangulations which decom- poses the edge set in two directed trees rooted at a sink. A weak version of this labeling is valid for Laman graphs; however, the labeling does not guarantee a decomposition into two trees. The binary labeling of Laman graphs of Huemer and Kappes is based on Henneberg constructions. The Henneberg construction provides a decomposition into two trees whereas the labeling does not. A Henneberg construction consists of two moves: I. Adding a vertex of degree two II.
    [Show full text]
  • Open Problems on Graph Drawing
    Open problems on Graph Drawing Alexandros Angelopoulos Corelab E.C.E - N.T.U.A. February 17, 2014 Outline Introduction - Motivation - Discussion Variants of thicknesses Thickness Geometric thickness Book thickness Bounds Complexity Related problems & future work 2/ Motivation: Air Traffic Management Separation -VerticalVertical - Lateral - Longitudinal 3/ Motivation: Air Traffic Management : Maximization of \free flight” airspace c d c d X f f i1 i4 i0 i2 i3 i5 e e Y a b a b 8 Direct-to flight (as a choice among \free flight") increases the complexity of air traffic patterns Actually... 4 Direct-to flight increases the complexity of air traffic patterns and we have something to study... 4/ Motivation: Air Traffic Management 5/ How to model? { Graph drawing & thicknesses Geometric thickness (θ¯) Book thickness (bt) Dillencourt et al. (2000) Bernhart and Kainen (1979) : only straight lines : convex positioning of nodes v4 v5 v1 v2 θ(G) ≤ θ¯(G) ≤ bt(G) v5 v3 v0 v4 4 v1 Applications in VLSI & graph visualizationv3 Thickness (θ) v0 8 θ, θ¯, bt characterize the graph (minimizations over all allowedv2 drawings) Tutte (1963), \classical" planar decomposition 6/ Geometric graphs and graph drawings Definition 1.1 (Geometric graph, Bose et al. (2006), many Erd¨ospapers). A geometric graph G is a pair (V (G);E(G)) where V (G) is a set of points in the plane in general position and E(G) is set of closed segments with endpoints in V (G). Elements of V (G) are vertices and elements of E(G) are edges, so we can associate this straight-line drawing with the underlying abstract graph G(V; E).
    [Show full text]
  • Local Page Numbers
    Local Page Numbers Bachelor Thesis of Laura Merker At the Department of Informatics Institute of Theoretical Informatics Reviewers: Prof. Dr. Dorothea Wagner Prof. Dr. Peter Sanders Advisor: Dr. Torsten Ueckerdt Time Period: May 22, 2018 – September 21, 2018 KIT – University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association www.kit.edu Statement of Authorship I hereby declare that this document has been composed by myself and describes my own work, unless otherwise acknowledged in the text. I declare that I have observed the Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis, as amended. Ich versichere wahrheitsgemäß, die Arbeit selbstständig verfasst, alle benutzten Hilfsmittel vollständig und genau angegeben und alles kenntlich gemacht zu haben, was aus Arbeiten anderer unverändert oder mit Abänderungen entnommen wurde, sowie die Satzung des KIT zur Sicherung guter wissenschaftlicher Praxis in der jeweils gültigen Fassung beachtet zu haben. Karlsruhe, September 21, 2018 iii Abstract A k-local book embedding consists of a linear ordering of the vertices of a graph and a partition of its edges into sets of edges, called pages, such that any two edges on the same page do not cross and every vertex has incident edges on at most k pages. Here, two edges cross if their endpoints alternate in the linear ordering. The local page number pl(G) of a graph G is the minimum k such that there exists a k-local book embedding for G. Given a graph G and a vertex ordering, we prove that it is NP-complete to decide whether there exists a k-local book embedding for G with respect to the given vertex ordering for any fixed k ≥ 3.
    [Show full text]
  • DISSERTATION GENERALIZED BOOK EMBEDDINGS Submitted By
    DISSERTATION GENERALIZED BOOK EMBEDDINGS Submitted by Shannon Brod Overbay Department of Mathematics In partial fulfillment of the requirements for the degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Summer 1998 COLORADO STATE UNIVERSITY May 13, 1998 WE HEREBY RECOMMEND THAT THE DISSERTATION PREPARED UNDER OUR SUPERVISION BY SHANNON BROD OVERBAY ENTITLED GENERALIZED BOOK EMBEDDINGS BE ACCEPTED AS FULFILLING IN PART REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSO- PHY. Committee on Graduate Work Adviser Department Head ii ABSTRACT OF DISSERTATION GENERALIZED BOOK EMBEDDINGS An n-book is formed by joining n distinct half-planes, called pages, together at a line in 3-space, called the spine. The book thickness bt(G) of a graph G is the smallest number of pages needed to embed G in a book so that the vertices lie on the spine and each edge lies on a single page in such a way that no two edges cross each other or the spine. In the first chapter, we provide background material on book embeddings of graphs and preview our results on several related problems. In the second chapter, we use a theorem of Bernhart and Kainen and a result of Whitney to present a large class of two-page embeddable planar graphs. In particular, we prove that a graph G that can be drawn in the plane so that G has no triangles other than faces can be embedded in a two-page book. The discussion of planar graphs continues in the third chapter where we define a book with a tree-spine.
    [Show full text]
  • On the Book Thickness of $ K $-Trees
    On the book thickness of k-trees∗ Vida Dujmovi´c† David R. Wood‡ May 29, 2018 Abstract Every k-tree has book thickness at most k + 1, and this bound is best possible for all k ≥ 3. Vandenbussche et al. (2009) proved that every k-tree that has a smooth degree-3 tree decomposition with width k has book thickness at most k. We prove this result is best possible for k ≥ 4, by constructing a k-tree with book thickness k + 1 that has a smooth degree-4 tree decomposition with width k. This solves an open problem of Vandenbussche et al. (2009) 1 Introduction Consider a drawing of a graph1 G in which the vertices are represented by distinct points on a circle in the plane, and each edge is a chord of the circle between the corresponding points. Suppose that each edge is assigned one of k colours such that crossing edges receive distinct colours. This structure is called a k-page book embedding of G: one can also think of the vertices as being ordered along the spine of a book, and the edges that receive the same colour being drawn on a single page of the book without crossings. The book thickness of G, denoted by bt(G), is the minimum integer k for which there is a k-page book embedding of G. Book embeddings, first defined by Ollmann [9], are ubiquitous structures with a vari- ety of applications; see [5] for a survey with over 50 references. A book embedding is also called a stack layout, and book thickness is also called stacknumber, pagenumber and fixed arXiv:0911.4162v1 [math.CO] 21 Nov 2009 outerthickness.
    [Show full text]
  • Upward Partitioned Book Embeddings
    Upward Partitioned Book Embeddings The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Akitaya, Hugo A. et al. "Upward Partitioned Book Embeddings." International Symposium on Graph Drawing and Network Visualization, September 2018, Barcelona, Spain, Springer International Publishing, January 2018. © 2018 Springer International Publishing AG As Published http://dx.doi.org/10.1007/978-3-319-73915-1_18 Publisher Springer International Publishing Version Original manuscript Citable link https://hdl.handle.net/1721.1/128437 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike Detailed Terms http://creativecommons.org/licenses/by-nc-sa/4.0/ Upward Partitioned Book Embeddings Hugo A. Akitaya1, Erik D. Demaine2, Adam Hesterberg2, and Quanquan C. Liu2 1 Tufts University, Medford, MA, USA hugo.alves [email protected] 2 Massachusetts Institute of Technology, Cambridge, MA, USA edemaine,achester,[email protected] Abstract. We analyze a directed variation of the book embedding prob- lem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into k pages, can we linearly or- der the vertices such that the drawing is upward (a topological sort) and each page avoids crossings? We prove that the problem is NP-complete for k ≥ 3, and for k ≥ 4 even in the special case when each page is a matching. By contrast, the problem can be solved in linear time for k = 2 pages when pages are restricted to matchings. The problem comes from Jack Edmonds (1997), motivated as a generalization of the map folding problem from computational origami.
    [Show full text]
  • Arxiv:1908.08911V1 [Cs.DS] 23 Aug 2019
    Parameterized Algorithms for Book Embedding Problems? Sujoy Bhore1, Robert Ganian1, Fabrizio Montecchiani2, and Martin N¨ollenburg1 1 Algorithms and Complexity Group, TU Wien, Vienna, Austria fsujoy,rganian,[email protected] 2 Engineering Department, University of Perugia, Perugia, Italy [email protected] Abstract. A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether G admits a k-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thickness, or not fixed, called Book Thickness. Both problems are known to be NP-complete in general. We show that Fixed-Order Book Thickness and Book Thickness are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed- Order Book Thickness is fixed-parameter tractable parameterized by the pathwidth of the vertex order. 1 Introduction A k-page book embedding of a graph G is a drawing that maps the vertices of G to distinct points on a line, called spine, and each edge to a simple curve drawn inside one of k half-planes bounded by the spine, called pages, such that no two edges on the same page cross [20,25]; see Fig.1 for an illustration. This kind of layout can be alternatively defined in combinatorial terms as follows. A k-page book embedding of G is a linear order ≺ of its vertices and a coloring of its edges which guarantee that no two edges uv, wx of the same color have their vertices ordered as u ≺ w ≺ v ≺ x.
    [Show full text]
  • RNA Structures with Pseudo-Knots: Graph-Theoretical, Combinatorial
    Bulletin of Mathematical Biology (1999) 61, 437–467 Article No. bulm.1998.0085 Available online at http://www.idealibrary.com on RNA Structures with Pseudo-knots: Graph-theoretical, Combinatorial, and Statistical Properties Christian Haslinger Institut f¨ur Theoretische Chemie, Universit¨at Wien W¨ahringerstraße 17, A-1090 Wien, Austria E-mail: [email protected] Peter F. Stadler∗ The Sante Fe Institute, 1399 Hyde Park Road, Sante Fe, NM 87501, U.S.A. E-mail: [email protected] or [email protected] The secondary structures of nucleic acids form a particularly important class of contact structures. Many important RNA molecules, however, contain pseudo- knots, a structural feature that is excluded explicitly from the conventional definition of secondary structures. We propose here a generalization of secondary structures incorporating ‘non-nested’ pseudo-knots, which we call bi-secondary structures, and discuss measures for the complexity of more general contact structures based on their graph-theoretical properties. Bi-secondary structures are planar trivalent graphs that are characterized by special embedding properties. We derive exact upper bounds on their number (as a function of the chain length n) implying that there are fewer different structures than sequences. Computational results show that the number of bi-secondary structures grows approximately like 2.35n. Numerical studies based on kinetic folding and a simple extension of the standard energy model show that the global features of the sequence-structure map of RNA do not change when pseudo-knots are introduced into the secondary structure picture. We find a large fraction of neutral mutations and, in particular, networks of sequences that fold into the same shape.
    [Show full text]
  • Embedding Planar Graphs in Four Pages
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES 38, 3667 (1989) Embedding Planar Graphs in Four Pages MIHALIS YANNAKAKIS AT & T Bell Laboratories, Murray Hill, New Jersey 07974 ReceivedSeptember 23, 1986; revised August 25, 1987 An algorithm is presented which embeds any planar graph in a book of four pages. The algorithm runs in linear time. 0 1989 Academic Press, Inc. 1. INTRODUCTION A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes), and an embedding of its edges on the pages so that edges embedded on the same page do not intersect. The objec- tive is to minimize the number of pages used. The minimum number of pages in which a graph can be embedded is called the pagenumber of the graph. The book embedding problem arises in connection with an approach to fault- tolerant VLSI design [R, CLRl, CLR2]. The graph models a desired interconnec- tion pattern among a set of processors. The processors are arranged (physically or logically) on a line and are tested to determine which ones are good and which are faulty. The good processors are interconnected via “bundles” of wires running parallel to the line. Each bundle functions like a stack: Scan the line from left to right and suppose that a good processor u wants to connect to some processor v to its right. At u, the connection (u, u) is pushed into one of the stack-bundles; that is, (u, Y) occupies the bottom wire of the bundle, while the other connections that are currently in this bundle are shifted up one place.
    [Show full text]
  • Fewer Bends Point-Set Embedding with Mapping
    6th International Conference on Electrical and Computer Engineering ICECE 2010, 18-20 December 2010, Dhaka, Bangladesh Fewer Bends Point-set Embedding with Mapping Md. Emran Chowdhury∗,MuhammadJawaherulAlam†, and Md. Saidur Rahman† ∗Department of Computer Science and Engineering, Northern University Bangladesh Email: [email protected] †Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology Email: [email protected], [email protected] v4 Abstract—An upward point-set embedding of an upward pla- nar digraph ! on a set of points " with a mapping Φ:# (!) " 3 is an upward planar drawing Γ of ! where each vertex of →! is placed on a point of " according to Φ. Γ is called an upward v3 1 4 topological book embedding of ! with the mapping Φ if the v2 points in " are aligned along a straight-line. In this paper, we 2 address the problem of minimizing the total number of bends v1 on the edges in an upward point-set embedding of ! with the G S mapping Φ. We first give an algorithm that finds an upward Fig. 1. An upward planar digraph ! with four vertices and a set " of four topological book embedding of ! with a mapping if such an points embedding exists. Using this result, we then give an algorithm to obtain an upward point-set embedding of ! with a mapping if it exists. The drawings obtained by our algorithm for both the problems contain at most ($-3)bendsperedge,whichimproves of ! where the ordering of the vertices along the spine follows the previously known upper bound of (2$-3)bendsperedge.
    [Show full text]
  • Generating Function Enumeration Example
    Combinatorics and Matrix model on RNA secondary structures SangKwan Choi Physics department, Sichuan University 1612.07468 w/ Chaiho Rim and Hwajin Um Integrability in low-dimensional quantum systems MATRIX, The University of Melbourne 26 June – 21 July 2017 Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? • Catalan number Recursion relation 퐶3 퐶2 Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? • Catalan number Recursion relation 퐶3 퐶2 Generating function Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? • Catalan number Recursion relation 퐶3 퐶2 Generating function Enumeration example Number of ways connecting vertices with non-crossing arcs on the upper half plane? • Catalan number Recursion relation 퐶3 퐶2 Generating function Enumeration in terms of Matrix model Gaussian matrix model 푉 − 퐸 + 퐹 = 휒 = 2 − 2푔 = 푁2 ( + ) + 푁0 Enumeration in terms of Matrix model Gaussian matrix model 푉 − 퐸 + 퐹 = 휒 = 2 − 2푔 = 푁2 ( + ) + 푁0 Enumeration in terms of Matrix model Gaussian matrix model 푉 − 퐸 + 퐹 = 휒 = 2 − 2푔 = 푁2 + + 푁0 ( ) Fatgraph Enumeration in terms of Matrix model Gaussian matrix model 푉 − 퐸 + 퐹 = 휒 = 2 − 2푔 = 푁2 + + 푁0 ( ) Fatgraph Enumeration in terms of Matrix model Gaussian
    [Show full text]
  • Planarity Testing and Embedding
    1 Planarity Testing and Embedding 1.1 Introduction................................................. 1 1.2 Properties and Characterizations of Planar Graphs . 2 Basic Definitions • Properties • Characterizations 1.3 Planarity Problems ........................................ 7 Constrained Planarity • Deletion and Partition Problems • Upward Planarity • Outerplanarity 1.4 History of Planarity Algorithms.......................... 10 1.5 Common Algorithmic Techniques and Tools ........... 10 1.6 Cycle-Based Algorithms ................................... 11 Adding Segments: The Auslander-Parter Algorithm • Adding Paths: The Hopcroft-Tarjan Algorithm • Adding Edges: The de Fraysseix-Ossona de Mendez-Rosenstiehl Algorithm 1.7 Vertex Addition Algorithms .............................. 17 The Lempel-Even-Cederbaum Algorithm • The Shih-Hsu Algorithm • The Boyer-Myrvold Algorithm 1.8 Frontiers in Planarity ...................................... 31 Simultaneous Planarity • Clustered Planarity • Maurizio Patrignani Decomposition-Based Planarity Roma Tre University References ................................................... ....... 34 1.1 Introduction Testing the planarity of a graph and possibly drawing it without intersections is one of the most fascinating and intriguing algorithmic problems of the graph drawing and graph theory areas. Although the problem per se can be easily stated, and a complete characterization of planar graphs has been known since 1930, the first linear-time solution to this problem was found only in the 1970s. Planar graphs
    [Show full text]