DOCSLIB.ORG

Separator Based Sparsification I. Planarity Testing and Minimum

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Separator Based Sparsification I. Planarity Testing and Minimum Journal of Computer and System Sciences SS1352 journal of computer and system sciences 52, 327 (1996) article no. 0002 View metadata, citation and similar papers at Separatorcore.ac.uk Based Sparsification brought to you by CORE provided by Elsevier - Publisher Connector I. Planarity Testing and Minimum Spanning Trees* David Eppstein- Department of Information and Computer Science, University of California, Irvine, California 92717 Zvi Galil Computer Science Department, Columbia University, New York, New York 10027; and Computer Science Department, Tel-Aviv University, Tel-Aviv, Israel Giuseppe F. Italiano Dipartimento di Informatica e Sistemistica, UniversitaÁ di Roma ``La Sapienza'', Rome, Italy and Thomas H. Spencer Department of Mathematics and Computer Science, University of Nebraska at Omaha, Omaha, Nebraska Received October 11, 1993 1. INTRODUCTION We describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions Sparsification was introduced in [2] as a technique for that preserve planarity but that can change the embedding. We give a fully dynamic planarity testing algorithm that maintains a graph subject designing fully dynamic graph algorithms, in which edges to edge insertions and deletions and that allows queries that test may be inserted into and deleted from a graph while some whether the graph is currently planar, or whether a potential new edge graph property must be maintained. This technique is based 1Â2 would violate planarity, in O(n ) amortized time per update or query. upon a combination of graph decomposition and edge We give fully dynamic algorithms for maintaining the connected com- elimination. Let G be a graph with m edges and n vertices: we ponents, the best swap and the minimum spanning forest of a planar graph in O(log n) worst-case time per insertion and O(log2 n) per partition the edges of G into a collection of sparse subgraphs deletion. Finally, we give fully dynamic algorithms for maintaining (i.e., subgraphs with O(n) edges), and summarize the relevant the 2-edge-connected components of a planar graph in O(log n) information for each subgraph in an even sparser certificate. 2 amortized time per insertion and O(log n) per deletion. All of the data We merge certificates in pairs, producing larger subgraphs structures, except for the one that answers planarity queries, handle only insertions that keep the graph planar. All our algorithms improve which we make sparse by again applying the certificate reduc- previous bounds. The improvements are based upon a new type of tion. The result is a balanced binary tree in which each node sparsification combined with several properties of separators in planar is represented by a sparse certificate. Each edge insertion or graphs. ] 1996 Academic Press, Inc. deletion causes changes in log(mÂn) tree nodes, but each such change occurs in a subgraph with O(n) edges, reduced from the m edges in the original graph. This reduces a time * Portions of this paper were presented at the ``25th Annual ACM Symp. bound of T(m, n)toO(T(O(n), n) log(mÂn)). Using a more on Theory of Computing, San Diego, CA, 1993'' [4] - Supported by NSF grant CCR-9258355. sophisticated approach (described in [3]), we can eliminate Work supported in part by NSF Grant CCR-90-14605 and CISE the logarithmic factor from this bound. This reduces the time Institutional Infrastructure Grant CCR-90-24735. bounds for many dynamic graph problems, including vertex On leave from IBM T. J. Watson Research Center, Yorktown Heights, and edge connectivity, and minimum spanning forests, to NY 10598. Work supported in part by ESPRIT BRA ALCOM II under exactly match the bounds known for sparse graphs. contract no. 7141 and by the Italian MURST Project ``Algoritmi, Modelli di Calcolo e Strutture Informative''. While sparsification has many applications in algorithms Research partially supported by the University Committee on Research, for arbitrary graphs, it seemed unlikely that it could be used University of Nebraska at Omaha. to speed up algorithms for families of graphs that are 3 0022-0000Â96 12.00 Copyright 1996 by Academic Press, Inc. All rights of reproduction in any form reserved. File: 571J 135201 . By:CV . Date:23:01:00 . Time:11:44 LOP8M. V8.0. Page 01:01 Codes: 6767 Signs: 4092 . Length: 60 pic 11 pts, 257 mm 4 EPPSTEIN ET AL. already sparse, such as planar graphs. However, algorithms previous bound was that for general graphs, O(n1Â2)[3].In for planar graphs are especially important, as these graphs the easier case where the embedding of the graph is fixed, it arise frequently in applications. We call a planar graph that was known how to solve this problem in time O(log n) per is committed to an embedding plane, and we use the term update [6, 9]. planar when changes in the embedding are allowed. We call v Third, we maintain the best swap [8] in a planar an edge insertion that preserves the embedding embed- graph, in O(log n) worst-case time per insertion or edge ding-preserving, whereas we call it planarity-preserving if it weight decrease, and O(log2 n) per deletion or edge weight keeps the graph planar (even though its embedding can increase. In the easier case of embedding-preserving inser- change); finally, we call an edge insertion arbitrary if it is not tions (i.e., when the embedding of the graph is fixed), it was known to preserve planarity. Previous work on dynamic known how to maintain the best swap in O(log3 n) time [8]. graph algorithms has used ad hoc techniques to solve a Our algorithm improves this bound as well. Frederickson number of problems such as minimum spanning forests, [8] uses a dynamic best swap algorithm to compute the k 2-edge-connectivity and planarity testing for plane graphs smallest spanning trees of a graph; with our new techniques, (with embedding-preserving insertions) [68, 12, 15, 18], this can be done in O(n+k log2 n) time for any planar graph. and 2- and 3-vertex-connectivity, and planarity under The best previous bound was O(n+k log3 n) [8]. planarity-preserving insertions or deletions on planar v Fourth, we maintain the 2-edge-connected components graphs [10, 11]. of a planar graph in O(log n) amortized time per planarity- In this paper we provide a new, general technique for preserving insertion or query and O(log2 n) per deletion. The dynamic planar graph problems, including those mentioned best previous bound was that for general graphs, O(n1Â2)[3]. above; in all these problems, we deal with either arbitrary or In the easier case where the embedding of the graph is fixed, planarity-preserving insertions and therefore allow changes it was known how to solve 2-edge-connectivity n O(log2 n) of the embedding. The new ideas behind this technique are time per update [15]. the following. We expand the notion of a certificate, to a definition for graphs in which a subset of the vertices are In the companion paper [5] we use the same technique denoted as interesting; these compressed certificates may to maintain the 3-edge-connected, 4-edge-connected, reduce the size of the graph by removing uninteresting ver- 2-vertex-connected, and 3-vertex-connected components tices. Using this notion, we define a type of sparsification of a planar graph in O(n1Â2) amortized time per operation. based on separators, small sets of vertices the removal of We believe that our minimum spanning forest, 2-edge- which splits the graph into roughly equal size components. connectivity and connectivity bounds are particularly Recursively finding separators in these components gives a interesting. Indeed, so far there was a huge gap in the time separator tree which we also use as our sparsification tree; complexity of fully dynamic algorithms for plane and for the interesting vertices in each certificate will be those planar graphs (such as, for instance, fully dynamic connec- vertices used in separators at higher levels of the tree. We tivity or minimum spanning forest). For plane graphs we introduce the notion of a balanced separator tree, which also typically knew bounds like O(polylog n)(O(log n) in our partitions the interesting vertices evenly in the tree: we show example), while for arbitrary updates on planar graphs the how to compute such a tree in linear time, and how to main- bounds were much higher (O(n1Â2) in our example). Even tain it dynamically. We believe that balanced separator trees worse, because of sparsification the latter bounds were often are interesting on their own and may find applications in exactly the bounds known for general graphs. In other other areas. Using this technique, we achieve the following words, while we knew how to exploit the properties of plane results. graphs, so far we could not exploit any property of planar graphs. Our new technique for the first time breaks this v First, we maintain a (not necessarily planar) graph barrier and shows how to efficiently exploit properties of subject to arbitrary edge insertions and deletions and planar graphs in a fully dynamic scenario. allow queries that test whether the graph is currently The remainder of the paper consists of the following sec- planar, or whether a potential new edge would violate 1Â2 tions. Section 2 defines precisely the compressed certificates planarity, in O(n ) amortized time per update or query. we need for speeding up algorithms on planar graphs, while The previous best known fully dynamic algorithm only Section 3 uses these certificates to develop our sparsifica- allowed planarity-preserving insertions and took time 2Â3 tion technique.
Load more

Recommended publications
  • Knowledge Spaces Applications in Education Knowledge Spaces
    Jean-Claude Falmagne · Dietrich Albert Christopher Doble · David Eppstein Xiangen Hu Editors Knowledge Spaces Applications in Education Knowledge Spaces Jean-Claude Falmagne • Dietrich Albert Christopher Doble • David Eppstein • Xiangen Hu Editors Knowledge Spaces Applications in Education Editors Jean-Claude Falmagne Dietrich Albert School of Social Sciences, Department of Psychology Dept. Cognitive Sciences University of Graz University of California, Irvine Graz, Austria Irvine, CA, USA Christopher Doble David Eppstein ALEKS Corporation Donald Bren School of Information Irvine, CA, USA & Computer Sciences University of California, Irvine Irvine, CA, USA Xiangen Hu Department of Psychology University of Memphis Memphis, TN, USA ISBN 978-3-642-35328-4 ISBN 978-3-642-35329-1 (eBook) DOI 10.1007/978-3-642-35329-1 Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2013942001 © Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer.
    [Show full text]
  • Drawing Graphs and Maps with Curves
    Report from Dagstuhl Seminar 13151 Drawing Graphs and Maps with Curves Edited by Stephen Kobourov1, Martin Nöllenburg2, and Monique Teillaud3 1 University of Arizona – Tucson, US, [email protected] 2 KIT – Karlsruhe Institute of Technology, DE, [email protected] 3 INRIA Sophia Antipolis – Méditerranée, FR, [email protected] Abstract This report documents the program and the outcomes of Dagstuhl Seminar 13151 “Drawing Graphs and Maps with Curves”. The seminar brought together 34 researchers from different areas such as graph drawing, information visualization, computational geometry, and cartography. During the seminar we started with seven overview talks on the use of curves in the different communities represented in the seminar. Abstracts of these talks are collected in this report. Six working groups formed around open research problems related to the seminar topic and we report about their findings. Finally, the seminar was accompanied by the art exhibition Bending Reality: Where Arc and Science Meet with 40 exhibits contributed by the seminar participants. Seminar 07.–12. April, 2013 – www.dagstuhl.de/13151 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling, G.2.2 Graph Theory, F.2.2 Nonnumerical Algorithms and Problems Keywords and phrases graph drawing, information visualization, computational cartography, computational geometry Digital Object Identifier 10.4230/DagRep.3.4.34 Edited in cooperation with Benjamin Niedermann 1 Executive Summary Stephen Kobourov Martin Nöllenburg Monique Teillaud License Creative Commons BY 3.0 Unported license © Stephen Kobourov, Martin Nöllenburg, and Monique Teillaud Graphs and networks, maps and schematic map representations are frequently used in many fields of science, humanities and the arts.
    [Show full text]
  • A Dynamic Data Structure for Planar Graph Embedding
    October 1987 UILU-ENG-87-2265 ACT-83 COORDINATED SCIENCE LABORATORY College of Engineering Applied Computation Theory A DYNAMIC DATA STRUCTURE FOR PLANAR GRAPH EMBEDDING Roberto Tamassia UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN Approved for Public Release. Distribution Unlimited. UNCLASSIFIED___________ SEÒjrtlfy CLASSIFICATION OP THIS PAGE REPORT DOCUMENTATION PAGE 1 a. REPORT SECURITY CLASSIFICATION 1b. RESTRICTIVE MARKINGS Unclassified None 2a. SECURITY CLASSIFICATION AUTHORITY 3. DISTRIBUTION/AVAILABIUTY OF REPORT 2b. DECLASSIFICATION / DOWNGRADING SCHEDULE Approved for public release; distribution unlimited 4. PERFORMING ORGANIZATION REPORT NUMBER(S) 5. MONITORING ORGANIZATION REPORT NUMBER(S) UILU-ENG-87-2265 ACT #83 6a. NAME OF PERFORMING ORGANIZATION 6b. OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION Coordinated Science Lab (If applicati!a) University of Illinois N/A National Science Foundation 6c ADDRESS (City, Statt, and ZIP Coda) 7b. ADDRESS (City, Stata, and ZIP Coda) 1101 W. Springfield Avenue 1800 G Street, N.W. Urbana, IL 61801 Washington, D.C. 20550 8a. NAME OF FUNDING/SPONSORING 8b. OFFICE SYMBOL 9. PROCUREMENT INSTRUMENT IDENTIFICATION NUMBER ORGANIZATION (If applicatila) National Science Foundation ECS-84-10902 8c. ADDRESS (City, Stata, and ZIP Coda) 10. SOURCE OF FUNDING NUMBERS 1800 G Street, N.W. PROGRAM PROJECT TASK WORK UNIT Washington, D.C. 20550 ELEMENT NO. NO. NO. ACCESSION NO. A Dynamic Data Structure for Planar Graph Embedding 12. PERSONAL AUTHOR(S) Tamassia, Roberto 13a. TYPE OF REPORT 13b. TIME COVERED 14-^ A T E OP REPORT (Year, Month, Day) 5. PAGE COUNT Technical FROM______ TO 1987, October 26 ? 41 16. SUPPLEMENTARY NOTATION 17. COSATI CODES 18. SUBJECT TERMS (Continua on ravarsa if nacassary and identify by block number) FIELD GROUP SUB-GROUP planar graph, planar embedding, dynamic data structure, on-line algorithm, analysis of algorithms present a dynamic data structure that allows for incrementally constructing a planar embedding of a planar graph.
    [Show full text]
  • Partial Duality and Closed 2-Cell Embeddings
    Partial duality and closed 2-cell embeddings To Adrian Bondy on his 70th birthday M. N. Ellingham1;3 Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, Tennessee 37240, U.S.A. [email protected] Xiaoya Zha2;3 Department of Mathematical Sciences, Box 34 Middle Tennessee State University Murfreesboro, Tennessee 37132, U.S.A. [email protected] April 28, 2016; to appear in Journal of Combinatorics Abstract In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band decompositions, and the other is in terms of the gem (graph-encoded map) representation of an embedding. We then use these to investigate when a partial dual is a closed 2-cell embedding, in which every face is bounded by a cycle in the graph. We obtain a necessary and sufficient condition for a partial dual to be closed 2-cell, and also a sufficient condition for no partial dual to be closed 2-cell. 1 Introduction In this paper a surface Σ means a connected compact 2-manifold without boundary. By an open or closed disk in Σ we mean a subset of the surface homeomorphic to such a subset of R2. By a simple closed curve or circle in Σ we mean an image of a circle in R2 under a continuous injective map; a simple arc is a similar image of [0; 1]. The closure of a set S is denoted S, and the boundary is denoted @S.
    [Show full text]
  • A Study of Solution Strategies for Some Graph
    A STUDY OF SOLUTION STRATEGIES FOR SOME GRAPH EMBEDDING PROBLEMS A Synopsis Submitted in the partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics Submitted by Aditi Khandelwal Prof. Gur Saran Prof. Kamal Srivastava Supervisor Co-supervisor Department of Mathematics Department of Mathematics Prof. Ravinder Kumar Prof. G.S. Tyagi Head, Department of Head, Department of Physics Mathematics Dean, Faculty of Science Department of Mathematics Faculty of Science, Dayalbagh Educational Institute (Deemed University) Dayalbagh, Agra-282005 March, 2017. A STUDY OF SOLUTION STRATEGIES FOR SOME GRAPH EMBEDDING PROBLEMS 1. Introduction Many problems of practical interest can easily be represented in the form of graph theoretical optimization problems like the Travelling Salesman Problem, Time Table Scheduling Problem etc. Recently, the application of metaheuristics and development of algorithms for problem solving has gained particular importance in the field of Computer Science and specially Graph Theory. Although various problems are polynomial time solvable, there are large number of problems which are NP-hard. Such problems can be dealt with using metaheuristics. Metaheuristics are a successful alternative to classical ways of solving optimization problems, to provide satisfactory solutions to large and complex problems. Although they are alternative methods to address optimization problems, there is no theoretical guarantee on results [JJM] but usually provide near optimal solutions in practice. Using heuristic
    [Show full text]
  • On Drawing a Graph Convexly in the Plane (Extended Abstract) *
    On Drawing a Graph Convexly in the Plane (Extended Abstract) * HRISTO N. DJIDJEV Department of Computer Science, Rice University, Hoston, TX 77251, USA Abstract. Let G be a planar graph and H be a subgraph of G. Given any convex drawing of H, we investigate the problem of how to extend the drawing of H to a convex drawing of G. We obtain a necessary and sufficient condition for the existence and a linear Mgorithm for the construction of such an extension. Our results and their corollaries generalize previous theoretical and algorithmic results of Tutte, Thomassen, Chiba, Yamanouchi, and Nishizeki. 1 Introduction The problem of embedding of a graph in the plane so that the resulting drawing has nice geometric properties has received recently .significant attention. This is due to the large number of applications including circuit and VLSI design, algorithm animation, information systems design and analysis. The reader is referred to [1] for annotated bibliography on graph drawings. The first linear-time algorithm for testing a graph for planarity was constructed by Hopcroft and Tarjan [9]. A different linear time algorithm was developed by Booth and Lueker [3], who made use of PQ-trees and a previous algorithm of Lempel et al. [11]. Using the information obtained during the planarity testing, one can find in linear time a planar representation of the graph, if it is planar. Such an algorithm based on [3] has been described by Chiba et al. [4]. A classical result established by Wagner states that every planar graph has a planar straight-line drawing [18].
    [Show full text]
  • On Self-Duality of Branchwidth in Graphs of Bounded Genus ⋆
    On Self-Duality of Branchwidth in Graphs of Bounded Genus ? Ignasi Sau a aMascotte project INRIA/CNRS/UNSA, Sophia-Antipolis, France; and Graph Theory and Comb. Group, Applied Maths. IV Dept. of UPC, Barcelona, Spain. Dimitrios M. Thilikos b bDepartment of Mathematics, National Kapodistrian University of Athens, Greece. Abstract A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we prove that bw(G∗) ≤ 6 · bw(G) + 2g − 4 for any graph G embedded in a surface of Euler genus g. Key words: graphs on surfaces, branchwidth, duality, polyhedral embedding. 1 Preliminaries A surface is a connected compact 2-manifold without boundaries. A surface Σ can be obtained, up to homeomorphism, by adding eg(Σ) crosscaps to the sphere. eg(Σ) is called the Euler genus of Σ. We denote by (G; Σ) a graph G embedded in a surface Σ. A subset of Σ meeting the drawing only at vertices of G is called G-normal. If an O-arc is G-normal, then we call it a noose. The length of a noose is the number of its vertices. Representativity, or face-width, is a parameter that quantifies local planarity and density of embeddings. The representativity rep(G; Σ) of a graph embedding (G; Σ) is the smallest length of a non-contractible noose in Σ.
    [Show full text]
  • Forbidden Configurations in Discrete Geometry
    FORBIDDEN CONFIGURATIONS IN DISCRETE GEOMETRY This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry and listing many open prob- lems. It unifies these mathematical and computational views using for- bidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of fig- ures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathe- matics including number theory, graph theory, and the theory of per- mutation patterns. Pseudocode is included for many algorithms that compute properties of point sets. David Eppstein is Chancellor’s Professor of Computer Science at the University of California, Irvine. He has more than 350 publications on subjects including discrete and computational geometry, graph the- ory, graph algorithms, data structures, robust statistics, social network analysis and visualization, mesh generation, biosequence comparison, exponential algorithms, and recreational mathematics. He has been the moderator for data structures and algorithms
    [Show full text]
  • Graphs in Nature
    Graphs in Nature David Eppstein University of California, Irvine Symposium on Geometry Processing, July 2019 Inspiration: Steinitz's theorem Purely combinatorial characterization of geometric objects: Graphs of convex polyhedra are exactly the 3-vertex-connected planar graphs Image: Kluka [2006] Overview Cracked surfaces, bubble foams, and crumpled paper also form natural graph-like structures What properties do these graphs have? How can we recognize and synthesize them? I. Cracks and Needles Motorcycle graphs: Canonical quad mesh partitioning Paper at SGP'08 [Eppstein et al. 2008] Problem: partition irregular quad-mesh into regular submeshes Inspiration: Light cycle game from TRON movies Mesh partitioning method Grow cut paths outwards from each irregular (non-degree-4) vertex Cut paths continue straight across regular (degree-4) vertices They stop when they run into another path Result: approximation to optimal partition (exact optimum is NP-complete) Mesh-free motorcycle graphs Earlier... Motorcycles move from initial points with given velocities When they hit trails of other motorcycles, they crash [Eppstein and Erickson 1999] Application of mesh-free motorcycle graphs Initially: A simplified model of the inward movement of reflex vertices in straight skeletons, a rectilinear variant of medial axes with applications including building roof construction, folding and cutting problems, surface interpolation, geographic analysis, and mesh construction Later: Subroutine for constructing straight skeletons of simple polygons [Cheng and Vigneron 2007; Huber and Held 2012] Image: Huber [2012] Construction of mesh-free motorcycle graphs Main ideas: Define asymmetric distance: Time when one motorcycle would crash into another's trail Repeatedly find closest pair and eliminate crashed motorcycle Image: Dancede [2011] O(n17=11+) [Eppstein and Erickson 1999] Improved to O(n4=3+) [Vigneron and Yan 2014] Additional log speedup using mutual nearest neighbors instead of closest pairs [Mamano et al.
    [Show full text]
  • Embeddings of Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 124 (1994) 217-228 217 North-Holland Embeddings of graphs Carsten Thomassen Mathematisk Institut, Danmarks Tekniske Hojskoie. Bygning 303, DK-Lyngby. Denmark Received 2 June 1990 Abstract We survey some recent results on graphs embedded in higher surfaces or general topological spaces. 1. Introduction A graph G is embedded in the topological space X if G is represented in X such that the vertices of G are distinct elements in X and an edge in G is a simple arc connecting its two ends such that no two edges intersect except possibly at a common end. Graph embeddings in a broad sense have existed since ancient time. Pretty tilings of the plane have been produced for aestetic or religious reasons (see e.g. [7]). The characterization of the Platonic solids may be regarded as a result on tilings of the sphere. The study of graph embeddings in a more restricted sense began with the 1890 conjecture of Heawood [S] that the complete graph K, can be embedded in the orientable surface S, provided Euler’s formula is not violated. That is, g >&(n - 3)(n -4). Much work on graph embeddings has been inspired by this conjecture the proof of which was not completed until 1968. A complete proof can be found in Ringel’s book [12]. Graph embedding problems also arise in the real world, for example in connection with the design of printed circuits. Also, algorithms involving graphs may be very sensitive to the way in which the graphs are represented.
    [Show full text]
  • Sparsification–A Technique for Speeding up Dynamic Graph Algorithms
    Sparsification–A Technique for Speeding Up Dynamic Graph Algorithms DAVID EPPSTEIN University of California, Irvine, Irvine, California ZVI GALIL Columbia University, New York, New York GIUSEPPE F. ITALIANO Universita` “Ca’ Foscari” di Venezia, Venice, Italy AND AMNON NISSENZWEIG Tel-Aviv University, Tel-Aviv, Israel Abstract. We provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time O(n1/2) per change; 3-edge connectivity, in time O(n2/3) per change; 4-edge connectivity, in time O(na(n)) per change; k-edge connectivity for constant k, in time O(nlogn) per change; 2-vertex connectivity, and 3-vertex connectivity, in time O(n) per change; and 4-vertex connectivity, in time O(na(n)) per change. A preliminary version of this paper was presented at the 33rd Annual IEEE Symposium on Foundations of Computer Science (Pittsburgh, Pa.), 1992. D. Eppstein was supported in part by National Science Foundation (NSF) Grant CCR 92-58355. Z. Galil was supported in part by NSF Grants CCR 90-14605 and CDA 90-24735. G. F. Italiano was supported in part by the CEE Project No. 20244 (ALCOM-IT) and by a research grant from Universita` “Ca’ Foscari” di Venezia; most of his work was done while at IBM T. J. Watson Research Center. Authors’ present addresses: D. Eppstein, Department of Information and Computer Science, University of California, Irvine, CA 92717, e-mail: [email protected], internet: http://www.ics.
    [Show full text]
  • Graph Embedding Algorithms
    Graph Embedding Algorithms by ANDREI GAGARIN A Thesis Submitted to the Faculty of Graduate Studies in Partial Fblfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Department of Computer Science University of Manitoba Winnipeg, Manitoba, Canada @ Copyright by Andrei Gagarin, 2003 June 11, 2003 THE UNIVERSITY OF MANITOBA FACULTY OF GRADUATE STUDIES *t*** COPYRIGHT PERMISSION PAGE GRAPH EMBEDDING ALGORITHMS BY ANDREI GAGARIN A Thesis/Practicum submitted to the Faculty of Graduate Studies of The University of Manitoba in partial fulfillment of the requirements of the degree of Doctor of Philosophy ANDREI GAGARIN @ 2OO3 permission has been granted to the Library of The University of Ma¡ritoba to lend or sell copies of this thesis/practicum, to the National Library of Canada to microfilm this thesis and to lend or sell copies of the film, and to University Microfilm Inc. to publish an abstract of this thesis/practicum. The author reserves other publication rights, and neither this thesis/practicum nor exteruive extracts from it may be printed or otherwise reproduced without the author's written permission. Abstract A topologi,cal surface,S can be obtained from the sphere by adding a number of handles and/or cross-caps. Any topological surface can be represented as a polygon whose sides are identified in pairs. The projectiue plane can be represented as a circular disk with opposite pairs of points on its boundary identified. The torus can be represented as a rectangle with opposite sides of its boundary identified. is possible to Given a graph G and a topological surface ^9, we ask whether it draw the graph on the surface without edge crossings.
    [Show full text]