48 research outputs found
Genus Distributions of cubic series-parallel graphs
We derive a quadratic-time algorithm for the genus distribution of any
3-regular, biconnected series-parallel graph, which we extend to any
biconnected series-parallel graph of maximum degree at most 3. Since the
biconnected components of every graph of treewidth 2 are series-parallel
graphs, this yields, by use of bar-amalgamation, a quadratic-time algorithm for
every graph of treewidth at most 2 and maximum degree at most 3.Comment: 21 page
Recommended from our members
Genus Distributions of Graphs Constructed Through Amalgamations
Graphs are commonly represented as points in space connected by lines. The points in space are the vertices of the graph, and the lines joining them are the edges of the graph. A general definition of a graph is considered here, where multiple edges are allowed between two vertices and an edge is permitted to connect a vertex to itself. It is assumed that graphs are connected, i.e., any vertex in the graph is reachable from another distinct vertex either directly through an edge connecting them or by a path consisting of intermediate vertices and connecting edges. Under this visual representation, graphs can be drawn on various surfaces. The focus of my research is restricted to a class of surfaces that are characterized as compact connected orientable 2-manifolds. The drawings of graphs on surfaces that are of primary interest follow certain prescribed rules. These are called 2-cellular graph embeddings, or simply embeddings. A well-known closed formula makes it easy to enumerate the total number of 2-cellular embeddings for a given graph over all surfaces. A much harder task is to give a surface-wise breakdown of this number as a sequence of numbers that count the number of 2-cellular embeddings of a graph for each orientable surface. This sequence of numbers for a graph is known as the genus distribution of a graph. Prior research on genus distributions of graphs has primarily focused on making calculations of genus distributions for specific families of graphs. These families of graphs have often been contrived, and the methods used for finding their genus distributions have not been general enough to extend to other graph families. The research I have undertaken aims at developing and using a general method that frames the problem of calculating genus distributions of large graphs in terms of a partitioning of the genus distributions of smaller graphs. To this end, I use various operations such as edge-amalgamation, self-edge-amalgamation, and vertex-amalgamation to construct large graphs out of smaller graphs, by coupling their vertices and edges together in certain consistent ways. This method assumes that the partitioned genus distribution of the smaller graphs is known or is easily calculable by computer, for instance, by using the famous Heffter-Edmonds algorithm. As an outcome of the techniques used, I obtain general recurrences and closed-formulas that give genus distributions for infinitely many recursively specifiable graph families. I also give an easily understood method for finding non-trivial examples of distinct graphs having the same genus distribution. In addition to this, I describe an algorithm that computes the genus distributions for a family of graphs known as the 4-regular outerplanar graphs
The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
Let be the number of rooted cubic maps with vertices on the
orientable surface of genus . We show that the sequence
is asymptotically normal with mean and variance asymptotic to
and , respectively. We derive an asymptotic expression for
when lies in any closed subinterval of . Using
rotation systems and Bender's theorem about generating functions with
fast-growing coefficients, we derive simple asymptotic expressions for the
numbers of rooted regular maps, disregarding the genus. In particular, we show
that the number of rooted cubic maps with vertices, disregarding the
genus, is asymptotic to
Recommended from our members
Methods for Computing Genus Distribution Using Double-Rooted Graphs
This thesis develops general methods for computing the genus distribution of various types of graph families, using the concept of double-rooted graphs, which are defined to be graphs with two vertices designated as roots (the methods developed in this dissertation are limited to the cases where one of the two roots is restricted to be of valence two). I define partials and productions, and I use these as follows: (i) to compute the genus distribution of a graph obtained through the vertex amalgamation of a double-rooted graph with a single-rooted graph, and to show how these can be used to obtain recurrences for the genus distribution of iteratively growing infinite graph families. (ii) to compute the genus distribution of a graph obtained (a) through the operation of self-vertex-amalgamation on a double-rooted graph, and (b) through the operation of edge-addition on a double-rooted graph, and finally (iii) to develop a method to compute the recurrences for the genus distribution of the graph family generated by the Cartesian product of P3 and Pn
Approximation algorithms for network design and cut problems in bounded-treewidth
This thesis explores two optimization problems, the group Steiner tree and firefighter problems, which are known to be NP-hard even on trees. We study the approximability of these problems on trees and bounded-treewidth graphs. In the group Steiner tree, the input is a graph and sets of vertices called groups; the goal is to choose one representative from each group and connect all the representatives with minimum cost. We show an O(log^2 n)-approximation algorithm for bounded-treewidth graphs, matching the known lower bound for trees, and improving the best possible result using previous techniques. We also show improved approximation results for group Steiner forest, directed Steiner forest, and a fault-tolerant version of group Steiner tree. In the firefighter problem, we are given a graph and a vertex which is burning. At each time step, we can protect one vertex that is not burning; fire then spreads to all unprotected neighbors of burning vertices. The goal is to maximize the number of vertices that the fire does not reach. On trees, a classic (1-1/e)-approximation algorithm is known via LP rounding. We prove that the integrality gap of the LP matches this approximation, and show significant evidence that additional constraints may improve its integrality gap. On bounded-treewidth graphs, we show that it is NP-hard to find a subpolynomial approximation even on graphs of treewidth 5. We complement this result with an O(1)-approximation on outerplanar graphs.Diese Arbeit untersucht zwei Optimierungsprobleme, von welchen wir wissen, dass sie selbst in BĂ€umen NP-schwer sind. Wir analysieren Approximationen fĂŒr diese Probleme in BĂ€umen und Graphen mit begrenzter Baumweite. Im Gruppensteinerbaumproblem, sind ein Graph und Mengen von Knoten (Gruppen) gegeben; das Ziel ist es, einen Knoten von jeder Gruppe mit minimalen Kosten zu verbinden. Wir beschreiben einen O(log^2 n)-Approximationsalgorithmus fĂŒr Graphen mit beschrĂ€nkter Baumweite, dies entspricht der zuvor bekannten unteren Schranke fĂŒr BĂ€ume und ist zudem eine Verbesserung ĂŒber die bestmöglichen Resultate die auf anderen Techniken beruhen. DarĂŒber hinaus zeigen wir verbesserte Approximationsresultate fĂŒr andere Gruppensteinerprobleme. Im Feuerwehrproblem sind ein Graph zusammen mit einem brennenden Knoten gegeben. In jedem Zeitschritt können wir einen Knoten der noch nicht brennt auswĂ€hlen und diesen vor dem Feuer beschĂŒtzen. Das Feuer breitet sich anschlieĂend zu allen Nachbarn aus. Das Ziel ist es die Anzahl der Knoten die vom Feuer unberĂŒhrt bleiben zu maximieren. In BĂ€umen existiert ein lang bekannter (1-1/e)-Approximationsalgorithmus der auf LP Rundung basiert. Wir zeigen, dass die GanzzahligkeitslĂŒcke des LP tatsĂ€chlich dieser Approximation entspricht, und dass weitere EinschrĂ€nkungen die GanzzahligkeitslĂŒcke möglicherweise verbessern könnten. FĂŒr Graphen mit beschrĂ€nkter Baumweite zeigen wir, dass es NP-schwer ist, eine sub-polynomielle Approximation zu finden