DOCSLIB.ORG

Graph Drawing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Graph Drawing Pro ceedings of the ALCOM International Workshop on Graph Drawing Sevres Parc of Saint Cloud Paris Septemb er Edited by G Di Battista P Eades H de Fraysseix P Rosenstiehl and R Tamassia DRAFT do not distribute Septemb er ALCOM International Workshop on Graph Drawing Sevres Parc of Saint Cloud Paris Septemb er Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks It is an emerging area of research that combines avors of graph theory and computational geometry The automatic generation of drawings of graphs has imp ortant applications in key computer technologies such as software enginering database design and visual interfaces Further challenging applications can b e found in architectural design circuit schematics and pro ject management Research on graph drawing has b een esp ecially active in the last decade Recent progress in computational geometry top ological graph theory and order theory has considerably aected the evolution of this eld and has widened the range of issues b eing investigated This rst international workshop on graph drawing covers ma jor trends in the area Pap ers describ e theorems algorithms graph drawing systems mathematical and exp erimental analyses practical exp erience and a wide variety of op en problems Authors come from diverse academic cultures from graph theory computational geometry and software engineering Supp ort from ALCOM I I ESPRIT BA and by EHESS is gratefully acknowledged we would also like to thank Mr David Montgomery for preparing this do cument Giusepp e Di Battista Univ Rome Italy dibattistaiasirmcnrit Peter Eades Univ Newcastle Australia eadescsnewcastleeduau Hub ert de Fraysseix CNRS France prosenstdmiensfr Pierre Rosenstiehl EHESS France prosenstdmiensfr Rob erto Tamassia Brown Univ USA rtcsbrownedu Contents J Pach New Developments in Geometric Graph Theory Prosenjit Bose William Lenhart and Giusepp e Liotta Characterizing Proximity Trees Franz J Brandenburg and Peter Eades A Note on a Separator Algorithm for Tree Embeddings and its Application to Free Tree Drawings Brian Regan Two Algorithms for Drawing Trees in Three Dimensions Go os Kant Giusepp e Liotta Rob erto Tamassia and Ioannis G Tollis Area Require ment of Visibility Representations of Trees Ashim Garg and Rob erto Tamassia Ecient Computation of Planar StraightLine Upward Drawings Uli Fomeier and Michael Kaufmann An Approach for BendMinimal Upward Drawing CThomassen Representations of Planar Graphs Patrice Ossona de Mendez On Lattice Structures Induced by Orientations Jan Krato chvl and Jir Matousek Complexity of Intersection Classes of Graphs Hub ert de Fraysseix Patrice Ossona de Mendez and Pierre Rosenstiehl On Triangle Contact Graphs Simone Pimont and Michel Terrenoire Characterisation and Construction of the Rect angular Dual of a Graph Go os Kant and Xin He Two Algorithms for Finding Rectangular Duals of Planar Graphs Go os Kant A More Compact Visibility Representation Anna Lubiw Cone Visibility Graphs Bo jan Mohar Circle Packing Representations in Polynomial Time Bo jan Mohar Martin Juvan and Joze Marincek Obstructions for Embedding Extension Problems Antoine Bergey Automorphisms and Genus on Generalised Maps Ivan Rival Upward Drawing on Surfaces Bo jan Mohar and Pierre Rosenstiehl Tessalation and Visibility Representations of Maps on the Torus Teresa M Przytycka and Jozef H Przytycki A Simple Construction of High Repre sentativity Triangulations Prosenjit Bose Hazel Everett Sandor Fekete Anna Lubiw Henk Meijer Kathleen Romanik Tom Shermer and Sue Whitesides On a Visibility Representation for Graphs in Three Dimensions Jianer Chen Saro ja P Kanchi and Jonathan L Gross On Graph Drawings with Smal lest Number of Faces Marc Bousset A Flow Model of Low Complexity for Twisting a Layout Giusepp e Di Battista Giusepp e Liotta and Francesco Vargiu Convex and nonConvex Cost Functions of Orthogonal Representations Giusepp e Di Battista and Luca Vismara Topology and Geometry of Planar Triangular Graphs Frank Dehne Hristo Djidjev and JorgRudiger Sack An Optimal PRAM Algorithms for Planar Convex Embedding Miki Shimabara Miyauchi Algorithms for Embedding Graphs Into a page Book Hossam ElGindy Michael Houle Bill Lenhart Mirka Miller David Rappap ort and Sue Whitesides Dominance Drawings of Bipartite Graphs Ulrich Finke and Klaus Hinrichs Computing the Overlay of Regular Planar Subdivi sions in Linear Time Alain Denise Generation of Random Planar Maps Joseph Manning Symmetric Drawings of Graphs Tomaz Pisanski Recognizing Symmetric Graphs Peter Eades and Tao Lin Algorithmic and Declarative Approaches to Aesthetic Layout Isab el F Cruz Rob erto Tamassia and Pascal Van Hentenryck A Visual Approach to Graph Drawing Gaby Zinmeister Layout of Trees with Attribute Graph Grammars Sandra P Foubister and Colin Runciman The Display Browsing and Filtering of Graphtrees Daniel Tunkelang ALayout Algorithm for Undirected Graphs Stephen C North Drawing Ranked Digraphs with Recursive Clusters Ioannis G Tollis and Chunliang Xia Graph Drawing Algorithms for the Design and Analysis of Telecommunication Networks Michael Himsolt A View to Graph Drawing Algorithms through GraphEd C L McCreary C L Combs D H Gill and J V Warren An Automated Graph Drawing System Using Graph Decomposition Michael Junger and Petra Mutzel Maximum Planar Subgraphs and Nice Embeddings Practical Layout Tools Peter Eades and Xavier Mendonca Heuristics for Planarization by Vertex Splitting Takao Ozawa Planar Graph Embedding with a Specied Set of FaceIndependent Vertices Bjorn Sigurd Benestad Johansen Implementation of the Planarity Testing Algorithm by Demoucron Malgrange and Pertuiset Jo el Small A Unied Approach to Testing Embedding and Drawing Planar Graphs Hermann StammWilbrandt A Simple LinearTime Algorithm for Embedding Maxi mal Planar Graphs H de Fraysseix and P Rosenstiehl The LeftRight Algorithm for Planarity Testing and Embedding P O de Mendez Connexity of Bipolar Orientations New Developments in Geometric Graph Theory J Pach Abstract not Available Characterizing Proximity Trees y z Prosenjit Bose William Lenhart and Giusepp e Liotta Much attention has b een given over the past several years to developing algorithms for emb edding abstract graphs in the plane such that the resulting drawing has certain geomet ric prop erties For example those graphs which admit planar drawings have b een completely characterized and ecient algorithms for pro ducing planar drawings of these graphs have b een designed For an overview of graph drawing problems and algorithms the reader is referred to the excellent bibliography of Di Battista Eades Tamassia and Tollis More over many problems in pattern recognition and classication geographic variation analysis geographic information systems computational geometry computational morphology and com puter vision use the underlying structure present in a set of data p oints revealed by means of a proximity graph A proximity graph attempts to exhibit the relation b etween p oints in a p oint set Two p oints are joined by an edge if they are deemed close by some proximity measure It is the measure that determines the typ e of graph that results Many dierent measures of proximity have b een dened The relatively closest graph the relative neighb orho o d graph the gabriel graph the mo died gabriel graph and the delaunay triangulation are but a few of the graphs that arise through dierent proximity measures An extensive survey on the current research in proximity graphs can b e found in Jaromczyk and Toussaint As the survey suggests interest in proximity graphs has b een increasing rapidly in the last few years but most of the interest has b een algorithmic and little attention has b een given to the combinatorial characteristics of these graphs Monma and Suri show that any tree with maximum vertex degree ve can b e drawn as a minimum spanning tree We study the problem of drawing trees as certain typ es of proximity graphs We say that a tree T can b e drawn as a proximity graph when there exists a set of p oints in the plane such that the proximity graph of that set of p oints is isomorphic to T Some sucient conditions for such drawings to exist have b een given by Cimikowski for relatively closest graphs by Matula and Sokal for gabriel graphs and by Urquhart for relative neighb orho o d graphs However there exists no complete combinatorial characterization for any of the these typ es of proximity graphs To this end we give a complete
Recommended publications
  • The Circle Packing Theorem

    The Circle Packing Theorem

    Alma Mater Studiorum · Università di Bologna SCUOLA DI SCIENZE Corso di Laurea in Matematica THE CIRCLE PACKING THEOREM Tesi di Laurea in Analisi Relatore: Pesentata da: Chiar.mo Prof. Georgian Sarghi Nicola Arcozzi Sessione Unica Anno Accademico 2018/2019 Introduction The study of tangent circles has a rich history that dates back to antiquity. Already in the third century BC, Apollonius of Perga, in his exstensive study of conics, introduced problems concerning tangency. A famous result attributed to Apollonius is the following. Theorem 0.1 (Apollonius - 250 BC). Given three mutually tangent circles C1, C2, 1 C3 with disjoint interiors , there are precisely two circles tangent to all the three initial circles (see Figure1). A simple proof of this fact can be found here [Sar11] and employs the use of Möbius transformations. The topic of circle packings as presented here, is sur- prisingly recent and originates from William Thurston's famous lecture notes on 3-manifolds [Thu78] in which he proves the theorem now known as the Koebe-Andreev- Thurston Theorem or Circle Packing Theorem. He proves it as a consequence of previous work of E. M. Figure 1 Andreev and establishes uniqueness from Mostov's rigid- ity theorem, an imporant result in Hyperbolic Geometry. A few years later Reiner Kuhnau pointed out a 1936 proof by german mathematician Paul Koebe. 1We dene the interior of a circle to be one of the connected components of its complement (see the colored regions in Figure1 as an example). i ii A circle packing is a nite set of circles in the plane, or equivalently in the Riemann sphere, with disjoint interiors and whose union is connected.
  • Bijective Counting of Plane Bipolar Orientations

    Bijective Counting of Plane Bipolar Orientations

    Bijective counting of plane bipolar orientations Eric´ Fusy ??, Dominique Poulalhon ??, and Gilles Schaeffer ?? a LIX, Ecole´ Polytechnique, 91128 Palaiseau Cedex-France b LIAFA (Universit´eParis Diderot), 2 place Jussieu 75251 Paris cedex 05 Abstract We introduce a bijection between plane bipolar orientations with fixed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with some specific extremities. Writing ϑij for the number of plane bipolar orientations with (i + 1) vertices and (j + 1) faces, our bijection provides a combinatorial proof of the following formula due to Baxter: (i + j − 2)! (i + j − 1)! (i + j)! (1) ϑij = 2 . (i − 1)! i! (i + 1)! (j − 1)! j! (j + 1)! Keywords: bijection, bipolar orientations, non-intersecting paths. 1 Introduction A bipolar orientation of a graph G = (V, E) is an acyclic orientation of G such that the induced partial order on the vertex set has a unique minimum s called the source, and a unique maximum t called the sink. Alternative definitions and many interesting properties are described in [?]. Bipolar ori- entations are a powerful combinatorial structure and prove insightful to solve many algorithmic problems such as planar graph embedding [?] and geometric representations of graphs in various flavours. As a consequence, it is an inter- esting issue to have a better understanding of their combinatorial properties. This extended abstract focuses on the enumeration of bipolar orientations in the planar case. Precisely, we consider bipolar orientations on rooted planar maps, where a planar map is a connected planar graph embedded in the plane without edge-crossings and up to isotopic deformation, and rooted means with a marked oriented edge (called the root) having the outer face on its left.
  • Digraph Complexity Measures and Applications in Formal Language Theory

    Digraph Complexity Measures and Applications in Formal Language Theory

    Digraph Complexity Measures and Applications in Formal Language Theory by Hermann Gruber Institut f¨urInformatik Justus-Liebig-Universit¨at Giessen Germany November 14, 2008 Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Overview 1 Introduction and Motivation 2 Measuring Complexity for Digraphs 3 Algorithmic Results on Cycle Rank 4 Applications in Formal Language Theory 5 Discussion H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Outline 1 Introduction and Motivation 2 Measuring Complexity for Digraphs 3 Algorithmic Results on Cycle Rank 4 Applications in Formal Language Theory 5 Discussion H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Complexity Measures on Undirected Graphs Important topic in algorithmic graph theory: Structural complexity restrictions can speed up algorithms Main result: many hard problems solvable in linear time on graphs with bounded treewidth. depending on application, also other measures interesting H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion What about Directed
  • Representing Graphs by Polygons with Edge Contacts in 3D

    Representing Graphs by Polygons with Edge Contacts in 3D

    Representing Graphs by Polygons with Side Contacts in 3D∗ Elena Arseneva1, Linda Kleist2, Boris Klemz3, Maarten Löffler4, André Schulz5, Birgit Vogtenhuber6, and Alexander Wolff7 1 Saint Petersburg State University, Russia [email protected] 2 Technische Universität Braunschweig, Germany [email protected] 3 Freie Universität Berlin, Germany [email protected] 4 Utrecht University, the Netherlands [email protected] 5 FernUniversität in Hagen, Germany [email protected] 6 Technische Universität Graz, Austria [email protected] 7 Universität Würzburg, Germany orcid.org/0000-0001-5872-718X Abstract A graph has a side-contact representation with polygons if its vertices can be represented by interior-disjoint polygons such that two polygons share a common side if and only if the cor- responding vertices are adjacent. In this work we study representations in 3D. We show that every graph has a side-contact representation with polygons in 3D, while this is not the case if we additionally require that the polygons are convex: we show that every supergraph of K5 and every nonplanar 3-tree does not admit a representation with convex polygons. On the other hand, K4,4 admits such a representation, and so does every graph obtained from a complete graph by subdividing each edge once. Finally, we construct an unbounded family of graphs with average vertex degree 12 − o(1) that admit side-contact representations with convex polygons in 3D. Hence, such graphs can be considerably denser than planar graphs. 1 Introduction A graph has a contact representation if its vertices can be represented by interior-disjoint geometric objects1 such that two objects touch exactly if the corresponding vertices are adjacent.
  • On Dynamical Gaskets Generated by Rational Maps, Kleinian Groups, and Schwarz Reflections

    On Dynamical Gaskets Generated by Rational Maps, Kleinian Groups, and Schwarz Reflections

    ON DYNAMICAL GASKETS GENERATED BY RATIONAL MAPS, KLEINIAN GROUPS, AND SCHWARZ REFLECTIONS RUSSELL LODGE, MIKHAIL LYUBICH, SERGEI MERENKOV, AND SABYASACHI MUKHERJEE Abstract. According to the Circle Packing Theorem, any triangulation of the Riemann sphere can be realized as a nerve of a circle packing. Reflections in the dual circles generate a Kleinian group H whose limit set is an Apollonian- like gasket ΛH . We design a surgery that relates H to a rational map g whose Julia set Jg is (non-quasiconformally) homeomorphic to ΛH . We show for a large class of triangulations, however, the groups of quasisymmetries of ΛH and Jg are isomorphic and coincide with the corresponding groups of self- homeomorphisms. Moreover, in the case of H, this group is equal to the group of M¨obiussymmetries of ΛH , which is the semi-direct product of H itself and the group of M¨obiussymmetries of the underlying circle packing. In the case of the tetrahedral triangulation (when ΛH is the classical Apollonian gasket), we give a piecewise affine model for the above actions which is quasiconformally equivalent to g and produces H by a David surgery. We also construct a mating between the group and the map coexisting in the same dynamical plane and show that it can be generated by Schwarz reflections in the deltoid and the inscribed circle. Contents 1. Introduction 2 2. Round Gaskets from Triangulations 4 3. Round Gasket Symmetries 6 4. Nielsen Maps Induced by Reflection Groups 12 5. Topological Surgery: From Nielsen Map to a Branched Covering 16 6. Gasket Julia Sets 18 arXiv:1912.13438v1 [math.DS] 31 Dec 2019 7.
  • Confluent Hasse Diagrams

    Confluent Hasse Diagrams

    Confluent Hasse diagrams David Eppstein Joseph A. Simons Department of Computer Science, University of California, Irvine, USA. October 29, 2018 Abstract We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with O(n2) features, in an O(n) × O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) fea- tures in an O(n) × O(n) grid in O(n) time from a series-parallel decomposition of the partial order. Our drawings are optimal in the number of confluent junctions they use. 1 Introduction One of the most important aspects of a graph drawing is that it should be readable: it should convey the structure of the graph in a clear and concise way. Ease of understanding is difficult to quantify, so various proxies for readability have been proposed; one of the most prominent is the number of edge crossings. That is, we should minimize the number of edge crossings in our drawing (a planar drawing, if possible, is ideal), since crossings make drawings harder to read. Another measure of readability is the total amount of ink required by the drawing [1]. This measure can be formulated in terms of Tufte’s “data-ink ratio” [22,35], according to which a large proportion of the ink on any infographic should be devoted to information. Thus given two different ways to present information, we should choose the more succinct and crossing-free presentation.
  • Analytical Framework for Recurrence-Network Analysis of Time Series

    Analytical Framework for Recurrence-Network Analysis of Time Series

    Analytical framework for recurrence-network analysis of time series Jonathan F. Donges,1, 2, ∗ Jobst Heitzig,1 Reik V. Donner,1 and J¨urgenKurths1, 2, 3 1Potsdam Institute for Climate Impact Research, P.O. Box 601203, 14412 Potsdam, Germany 2Department of Physics, Humboldt University Berlin, Newtonstr. 15, 12489 Berlin, Germany 3Institute for Complex Systems and Mathematical Biology, University of Aberdeen, Aberdeen AB24 3FX, United Kingdom (Dated: August 13, 2018) Recurrence networks are a powerful nonlinear tool for time series analysis of complex dynamical systems. While there are already many successful applications ranging from medicine to paleoclima- tology, a solid theoretical foundation of the method has still been missing so far. Here, we interpret an "-recurrence network as a discrete subnetwork of a \continuous" graph with uncountably many vertices and edges corresponding to the system's attractor. This step allows us to show that various statistical measures commonly used in complex network analysis can be seen as discrete estimators of newly defined continuous measures of certain complex geometric properties of the attractor on the scale given by ". In particular, we introduce local measures such as the "-clustering coefficient, mesoscopic measures such as "-motif density, path-based measures such as "-betweennesses, and global measures such as "-efficiency. This new analytical basis for the so far heuristically motivated network measures also provides an objective criterion for the choice of " via a percolation threshold, and it shows that estimation can be improved by so-called node splitting invariant versions of the measures. We finally illustrate the framework for a number of archetypical chaotic attractors such as those of the Bernoulli and logistic maps, periodic and two-dimensional quasi-periodic motions, and for hyperballs and hypercubes, by deriving analytical expressions for the novel measures and com- paring them with data from numerical experiments.
  • Complexity and Geometry of Sampling Connected Graph Partitions

    Complexity and Geometry of Sampling Connected Graph Partitions

    COMPLEXITY AND GEOMETRY OF SAMPLING CONNECTED GRAPH PARTITIONS LORENZO NAJT∗, DARYL DEFORDy, JUSTIN SOLOMONy Abstract. In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use gadgets inspired by their technique to provide families of graphs where the “flip walk" Markov chain used in practice for this sampling task exhibits exponentially slow mixing. Supporting our theoretical results we present some empirical evidence demonstrating the slow mixing of the flip walk on grid graphs and on real data. Inspired by connections to the statistical physics of self-avoiding walks, we investigate the sensitivity of certain popular sampling algorithms to the graph topology. Finally, we discuss a few cases where the sampling problem is tractable. Applications to political redistricting have recently brought increased attention to this problem, and we articulate open questions about this application that are highlighted by our results. 1. Introduction. The problem of graph partitioning, or dividing the vertices of a graph into a small number of connected subgraphs that extremize an objective function, is a classical task in graph theory with application to network analytics, machine learning, computer vision, and other areas. Whereas this task is well-studied in computation and mathematics, a related problem remains relatively understudied: understanding how a given partition compares to other members of the set of possible partitions. In this case, the goal is not to generate a partition with favorable properties, but rather to compare a given partition to some set of alternatives.
  • Study on the Problem of the Number Ring Transformation

    Study on the Problem of the Number Ring Transformation

    The Research on Circle Family and Sphere Family The Original Topic: The Research and Generalizations on Several Kinds of Partition Problems in Combinatorics The Affiliated High School of South China Normal University Yan Chen Zhuang Ziquan Faculty Adviser：Li Xinghuai 153 The Research on Circle Family and Sphere Family 【Abstract】 A circle family is a group of separate or tangent circles in the plane. In this paper, we study how many parts at most a plane can be divided by several circle families if the circles in a same family must be separate (resp. if the circles can be tangent). We also study the necessary conditions for the intersection of two circle families. Then we primarily discuss the similar problems in higher dimensional space and in the end, raise some conjectures. 【Key words】 Circle Family; Structure Graph; Sphere Family; Generalized Inversion 【Changes】 1. Part 5 ‘Some Conjectures and Unsolved Problems’ has been rewritten. 2. Lemma 4.2 has been restated. 3. Some small mistakes have been corrected. 154 1 The Definitions and Preliminaries To begin with, we introduce some newly definitions and related preliminaries. Definition 1.1 Circle Family A circle family of the first kind is a group of separate circles；A circle family of the second kind is a group of separate or tangent circles. The capacity of a circle family is the number of circles in a circle family，the intersection of circle families means there are several circle families and any two circles in different circle families intersect. Definition 1.2 Compaction If the capacity of a circle family is no less than 3，and it intersects with another circle family with capacity 2，we call such a circle family compact.
  • List of NP-Complete Problems from Wikipedia, the Free Encyclopedia

    List of NP-Complete Problems from Wikipedia, the Free Encyclopedia

    List of NP -complete problems - Wikipedia, the free encyclopedia Page 1 of 17 List of NP-complete problems From Wikipedia, the free encyclopedia Here are some of the more commonly known problems that are NP -complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP-complete problems). Most of the problems in this list are taken from Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Completeness , and are here presented in the same order and organization. Contents ■ 1 Graph theory ■ 1.1 Covering and partitioning ■ 1.2 Subgraphs and supergraphs ■ 1.3 Vertex ordering ■ 1.4 Iso- and other morphisms ■ 1.5 Miscellaneous ■ 2 Network design ■ 2.1 Spanning trees ■ 2.2 Cuts and connectivity ■ 2.3 Routing problems ■ 2.4 Flow problems ■ 2.5 Miscellaneous ■ 2.6 Graph Drawing ■ 3 Sets and partitions ■ 3.1 Covering, hitting, and splitting ■ 3.2 Weighted set problems ■ 3.3 Set partitions ■ 4 Storage and retrieval ■ 4.1 Data storage ■ 4.2 Compression and representation ■ 4.3 Database problems ■ 5 Sequencing and scheduling ■ 5.1 Sequencing on one processor ■ 5.2 Multiprocessor scheduling ■ 5.3 Shop scheduling ■ 5.4 Miscellaneous ■ 6 Mathematical programming ■ 7 Algebra and number theory ■ 7.1 Divisibility problems ■ 7.2 Solvability of equations ■ 7.3 Miscellaneous ■ 8 Games and puzzles ■ 9 Logic ■ 9.1 Propositional logic ■ 9.2 Miscellaneous ■ 10 Automata and language theory ■ 10.1 Automata theory http://en.wikipedia.org/wiki/List_of_NP-complete_problems 12/1/2011 List of NP -complete problems - Wikipedia, the free encyclopedia Page 2 of 17 ■ 10.2 Formal languages ■ 11 Computational geometry ■ 12 Program optimization ■ 12.1 Code generation ■ 12.2 Programs and schemes ■ 13 Miscellaneous ■ 14 See also ■ 15 Notes ■ 16 References Graph theory Covering and partitioning ■ Vertex cover [1][2] ■ Dominating set, a.k.a.
  • Upward Embeddings and Orientations of Undirected Planar Graphs Walter Didimo Dipartimento Di Ingegneria Elettronica E Dell’Informazione Universit`A Di Perugia Via G

    Upward Embeddings and Orientations of Undirected Planar Graphs Walter Didimo Dipartimento Di Ingegneria Elettronica E Dell’Informazione Universit`A Di Perugia Via G

    Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 7, no. 2, pp. 221–241 (2003) Upward Embeddings and Orientations of Undirected Planar Graphs Walter Didimo Dipartimento di Ingegneria Elettronica e dell’Informazione Universit`a di Perugia via G. Duranti 93, 06125 Perugia, Italy. http://www.diei.unipg.it/~didimo/ [email protected] Maurizio Pizzonia Dipartimento di Informatica e Automazione Universit`a di Roma Tre via della Vasca Navale 79, 00146 Roma, Italy. http://www.dia.uniroma3.it/~pizzonia/ [email protected] Abstract An upward embedding of an embedded planar graph specifies, for each vertex v, which edges are incident on v “above” or “below” and, in turn, induces an upward orientation of the edges from bottom to top. In this paper we characterize the set of all upward embeddings and orientations of an embedded planar graph by using a simple flow model, which is re- lated to that described by Bousset [3] to characterize bipolar orientations. We take advantage of such a flow model to compute upward orientations with the minimum number of sources and sinks of 1-connected embedded planar graphs. We finally devise a new algorithm for computing visibility representations of 1-connected planar graphs using our theoretic results. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised April 2002. Research partially supported by “Progetto ALINWEB: Algoritmica per Internet e per il Web”, MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale. W. Didimo and M. Pizzonia, Upward Embeddings, JGAA, 7(2) 221–241 (2003)222 1 Introduction Let G be an undirected planar graph with a given planar embedding.
  • Algorithms for Incremental Planar Graph Drawing and Two-Page Book Embeddings

    Algorithms for Incremental Planar Graph Drawing and Two-Page Book Embeddings

    Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings Inaugural-Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakult¨at der Universit¨at zu Koln¨ vorgelegt von Martin Gronemann aus Unna Koln¨ 2015 Berichterstatter (Gutachter): Prof. Dr. Michael Junger¨ Prof. Dr. Markus Chimani Prof. Dr. Bettina Speckmann Tag der m¨undlichenPr¨ufung: 23. Juni 2015 Zusammenfassung Diese Arbeit besch¨aftigt sich mit zwei Problemen bei denen es um Knoten- ordnungen in planaren Graphen geht. Hierbei werden als erstes Ordnungen betrachtet, die als Grundlage fur¨ inkrementelle Zeichenalgorithmen dienen. Solche Algorithmen erweitern in der Regel eine vorhandene Zeichnung durch schrittweises Hinzufugen¨ von Knoten in der durch die Ordnung gegebene Rei- henfolge. Zu diesem Zweck kommen im Gebiet des Graphenzeichnens verschie- dene Ordnungstypen zum Einsatz. Einigen dieser Ordnungen fehlen allerdings gewunschte¨ oder sogar fur¨ einige Algorithmen notwendige Eigenschaften. Diese Eigenschaften werden genauer untersucht und dabei ein neuer Typ von Ord- nung entwickelt, die sogenannte bitonische st-Ordnung, eine Ordnung, welche Eigenschaften kanonischer Ordnungen mit der Flexibilit¨at herk¨ommlicher st- Ordnungen kombiniert. Die zus¨atzliche Eigenschaft bitonisch zu sein erm¨oglicht es, eine st-Ordnung wie eine kanonische Ordnung zu verwenden. Es wird gezeigt, dass fur¨ jeden zwei-zusammenh¨angenden planaren Graphen eine bitonische st-Ordnung in linearer Zeit berechnet werden kann. Im Ge- gensatz zu kanonischen Ordnungen, k¨onnen st-Ordnungen naturgem¨aß auch fur¨ gerichtete Graphen verwendet werden. Diese F¨ahigkeit ist fur¨ das Zeichnen von aufw¨artsplanaren Graphen von besonderem Interesse, da eine bitonische st-Ordnung unter Umst¨anden es erlauben wurde,¨ vorhandene ungerichtete Zei- chenverfahren fur¨ den gerichteten Fall anzupassen.