34 research outputs found
Partial triangulations of surfaces with girth constraints
Barnette and Edelson have shown that there are finitely many minimal
triangulations of a connected compact 2-manifold M. A similar finiteness result
is obtained for cellular partial triangulations that satisfy the Maxwell count
3v-e=6 and girth inequality constraints for certain embedded cycles. Also a
characterisation of cellular M-embedded (3,6)-tight graphs is given in terms of
the satisfaction of higher genus girth inequalities.Comment: 20 pages, 5 figure
Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Local certification consists in assigning labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked locally. In the last few years, certification of graph classes received a considerable attention. The goal is to certify that a graph G belongs to a given graph class ?. Such certifications with labels of size O(log n) (where n is the size of the network) exist for trees, planar graphs and graphs embedded on surfaces. Feuilloley et al. ask if this can be extended to any class of graphs defined by a finite set of forbidden minors.
In this work, we develop new decomposition tools for graph certification, and apply them to show that for every small enough minor H, H-minor-free graphs can indeed be certified with labels of size O(log n). We also show matching lower bounds using a new proof technique
On Positive Braids, Monodromy Groups and Framings
We associate to every positive braid a braid monodromy group, generalizing
the geometric monodromy group of an isolated plane curve singularity. If the
closure of the braid is a knot, we identify the corresponding group with a
framed mapping class group. In particular, this gives a well defined knot
invariant. As an application, we obtain that the geometric monodromy group of
an irreducible singularity is determined by the genus and the Arf invariant of
the associated knot.Comment: 37 pages, 34 figures; references added, improved introductio
CHAIN DECOMPOSITIONS OF 4-CONNECTED GRAPHS
Conselho Nacional de Desenvolvimento CientĂfico e TecnolĂłgico (CNPq)In this paper we give a decomposition of a 4-connected graph G into nonseparating chains, which is similar to an ear decomposition of a 2-connected graph. We also give an O(vertical bar V (G)vertical bar(2)vertical bar E (G)vertical bar) algorithm that constructs such a decomposition. In applications, the asymptotic performance can often be improved to O(vertical bar V (G)vertical bar(3)). This decomposition will be used to find four independent spanning trees in a 4-connected graph.194848880Conselho Nacional de Desenvolvimento CientĂfico e TecnolĂłgico (CNPq)NSF [DMS9970527, DMS0245530]NSA [MDA904-03-1-0052]Conselho Nacional de Desenvolvimento CientĂfico e TecnolĂłgico (CNPq)CNPq [200611/00-3]NSF [DMS9970527, DMS0245530]NSA [MDA904-03-1-0052
Facets of Planar Graph Drawing
This thesis makes a contribution to the field of Graph Drawing, with a focus on the planarity drawing convention. The following three problems are considered.
(1) Ordered Level Planarity:
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with respect to both the maximum degree and the level-width, that is, the maximum number of vertices that share a level. Our study of Ordered Level Planarity is motivated by connections to several other graph drawing problems. With reductions from Ordered Level Planarity, we show NP-hardness of multiple problems whose complexity was previously open, and strengthen several previous hardness results. In particular, our reduction to Clustered Level Planarity generates instances with only two nontrivial clusters. This answers a question posed by Angelini, Da Lozzo, Di Battista, Frati, and Roselli [2015]. We settle the complexity of the Bi-Monotonicity problem, which was proposed by Fulek, Pelsmajer, Schaefer, and Stefankovic [2013]. We also present a reduction to Manhattan Geodesic Planarity, showing that a previously [2009] claimed polynomial time algorithm is incorrect unless P=NP.
(2) Two-page book embeddings of triconnected planar graphs:
We show that every triconnected planar graph of maximum degree five is a subgraph of a Hamiltonian planar graph or, equivalently, it admits a two-page book embedding. In fact, our result is more general: we only require vertices of separating 3-cycles to have degree at most five, all other vertices may have arbitrary degree. This degree bound is tight: we describe a family of triconnected planar graphs that cannot be realized on two pages and where every vertex of a separating 3-cycle has degree at most six. Our results strengthen earlier work by Heath [1995] and by Bauernöppel [1987] and, independently, Bekos, Gronemann, and Raftopoulou [2016], who showed that planar graphs of maximum degree three and four, respectively, can always be realized on two pages. The proof is constructive and yields a quadratic time algorithm to realize the given graph on two pages.
(3) Convexity-increasing morphs:
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal.Diese Arbeit behandelt drei unterschiedliche Problemstellungen aus der Disziplin des Graphenzeichnens (Graph Drawing). Bei jedem der behandelten Probleme ist die gesuchte Darstellung planar.
(1) Ordered Level Planarity:
Wir führen das Problem Ordered Level Planarity ein, bei dem es darum geht, einen Graph so zu zeichnen, dass jeder Knoten an einer vorgegebenen Position der Ebene platziert wird und die Kanten als y-monotone Kurven dargestellt werden. Dies kann als eine Variante von Level Planarity interpretiert werden, bei der die Knoten jedes Levels in einer vorgeschriebenen Reihenfolge platziert werden müssen. Wir klassifizieren die Eingaben bezüglich ihrer Komplexität in Abhängigkeit von sowohl dem Maximalgrad, als auch der maximalen Anzahl von Knoten, die demselben Level zugeordnet sind. Wir motivieren die Ergebnisse, indem wir Verbindungen zu einigen anderen Graph Drawing Problemen herleiten: Mittels Reduktionen von Ordered Level Planarity zeigen wir die NP-Schwere einiger Probleme, deren Komplexität bislang offen war. Insbesondere wird gezeigt, dass Clustered Level Planarity bereits für Instanzen mit zwei nichttrivialen Clustern NP-schwer ist, was eine Frage von Angelini, Da Lozzo, Di Battista, Frati und Roselli [2015] beantwortet. Wir zeigen die NP-Schwere des Bi-Monotonicity Problems und beantworten damit eine Frage von Fulek, Pelsmajer, Schaefer und Stefankovic [2013]. Außerdem wird eine Reduktion zu Manhattan Geodesic Planarity angegeben. Dies zeigt, dass ein bestehender [2009] Polynomialzeitalgorithmus für dieses Problem inkorrekt ist, es sei denn, dass P=NP ist.
(2) Bucheinbettungen von dreifach zusammenhängenden planaren Graphen mit zwei Seiten:
Wir zeigen, dass jeder dreifach zusammenhängende planare Graph mit Maximalgrad 5 Teilgraph eines Hamiltonischen planaren Graphen ist. Dies ist äquivalent dazu, dass ein solcher Graph eine Bucheinbettung auf zwei Seiten hat. Der Beweis ist konstruktiv und zeigt in der Tat sogar, dass es für die Realisierbarkeit nur notwendig ist, den Grad von Knoten separierender 3-Kreise zu beschränken - die übrigen Knoten können beliebig hohe Grade aufweisen. Dieses Ergebnis ist bestmöglich: Wenn die Gradschranke auf 6 abgeschwächt wird, gibt es Gegenbeispiele. Diese Ergebnisse verbessern Resultate von Heath [1995] und von Bauernöppel [1987] und, unabhängig davon, Bekos, Gronemann und Raftopoulou [2016], die gezeigt haben, dass planare Graphen mit Maximalgrad 3 beziehungsweise 4 auf zwei Seiten realisiert werden können.
(3) Konvexitätssteigernde Deformationen:
Wir zeigen, dass jede planare geradlinige Zeichnung eines intern dreifach zusammenhängenden planaren Graphen stetig zu einer solchen deformiert werden kann, in der jede Fläche ein konvexes Polygon ist. Dabei erhält die Deformation die Planarität und ist konvexitätssteigernd - sobald ein Winkel konvex ist, bleibt er konvex. Wir geben einen effizienten Algorithmus an, der eine solche Deformation berechnet, die aus einer asymptotisch optimalen Anzahl von Schritten besteht. In jedem Schritt bewegen sich entweder alle Knoten entlang horizontaler oder entlang vertikaler Geraden
Recommended from our members
Computational and Analytical Tools for Resilient and Secure Power Grids
Enhancing power grids' performance and resilience has been one of the greatest challenges in engineering and science over the past decade. A recent report by the National Academies of Sciences, Engineering, and Medicine along with other studies emphasizes the necessity of deploying new ideas and mathematical tools to address the challenges facing the power grids now and in the future. To full this necessity, numerous grid modernization programs have been initiated in recent years. This thesis focuses on one of the most critical challenges facing power grids which is their vulnerability against failures and attacks. Our approach bridges concepts in power engineering and computer science to improve power grids resilience and security. We analyze the vulnerability of power grids to cyber and physical attacks and failures, design efficient monitoring schemes for robust state estimation, develop algorithms to control the grid under tension, and introduce methods to generate realistic power grid test cases. Our contributions can be divided into four major parts:
Power Grid State Prediction: Large scale power outages in Australia (2016), Ukraine (2015), Turkey (2015), India (2013), and the U.S. (2011, 2003) have demonstrated the vulnerability of power grids to cyber and physical attacks and failures. Power grid outages have devastating effects on almost every aspect of modern life as well as on interdependent systems. Despite their inevitability, the effects of failures on power grids' performance can be limited if the system operator can predict and understand the consequences of an initial failure and can immediately detect the problematic failures. To enable these capabilities, we study failures in power grids using computational and analytical tools based on the DC power flow model. We introduce new metrics to efficiently evaluate the severity of an initial failure and develop efficient algorithms to predict its consequences. We further identify power grids' vulnerabilities using these metrics and algorithms.
Power Grid State Estimation: In order to obtain an accurate prediction of the subsequent effects of an initial failure on the performance of the grid, the system operator needs to exactly know when and where the initial failure has happened. However, due to lack of enough measurement devices or a cyber attack on the grid, such information may not be available directly to the grid operator via measurements. To address this problem, we develop efficient methods to estimate the state of the grid and detect failures (if any) from partial available information.
Power Grid Control: Once an initial failure is detected, prediction methods can be used to predict the subsequent effects of that failure. If the initial failure is causing a cascade of failures in the grid, a control mechanism needs to be applied in order to mitigate its further effects. Power Grid Islanding is an effective method to mitigate cascading failures. The challenge is to partition the network into smaller connected components, called islands, so that each island can operate independently for a short period of time. This is to prevent the system to be separated into unbalanced parts due to cascading failures. To address this problem, we introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem and provide an efficient algorithm to partition the power grid into two operating islands.
Power Grid Test Cases for Evaluation: In order to evaluate algorithms that are developed for enhancing power grids resilience, one needs to study their performance on the real grid data. However, due to security reasons, such data sets are not publicly available and are very hard to obtain. Therefore, we study the structural properties of the U.S. Western Interconnection grid (WI), and based on the results we present the Network Imitating Method Based on LEarning (NIMBLE) for generating synthetic spatially embedded networks with similar properties to a given grid. We apply NIMBLE to the WI and show that the generated network has similar structural and spatial properties as well as the same level of robustness to cascading failures.
Overall, the results provided in this thesis advance power grids' resilience and security by providing a better understanding of the system and by developing efficient algorithms to protect it at the time of failure