Results 1  10
of
45
Approximation algorithms via contraction decomposition
 Proc. 18th Ann. ACMSIAM Symp. Discrete Algorithms ACMSIAM symposium on Discrete algorithms
, 2007
"... We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound depends on k). This decomposition result parallels an analogous, simpler result for edge ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bounded treewidth (where the bound depends on k). This decomposition result parallels an analogous, simpler result for edge deletions instead of contractions, obtained in [Bak94, Epp00, DDO + 04, DHK05], and it generalizes a similar result for “compression ” (a variant of contraction) in planar graphs [Kle05]. Our decomposition result is a powerful tool for obtaining PTASs for contractionclosed problems (whose optimal solution only improves under contraction), a much more general class than minorclosed problems. We prove that any contractionclosed problem satisfying just a few simple conditions has a PTAS in boundedgenus graphs. In particular, our framework yields PTASs for the weighted Traveling Salesman Problem and for minimumweight cedgeconnected submultigraph on boundedgenus graphs, improving and generalizing previous algorithms of [GKP95, AGK + 98, Kle05, Gri00, CGSZ04, BCGZ05]. We also highlight the only main difficulty in extending our results to general Hminorfree graphs.
Graph Minor Theory
 BULLETIN (NEW SERIES) OF THE AMERICAN MATHEMATICAL SOCIETY
, 2005
"... A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski’s characterization of planar graphs, and a farreaching ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski’s characterization of planar graphs, and a farreaching generalization of this, conjectured by Wagner: If a class of graphs is minorclosed (i.e., it is closed under deleting and contracting edges), then it can be characterized by a finite number of excluded minors. The proof of this conjecture is based on a very general theorem about the structure of large graphs: If a minorclosed class of graphs does not contain all graphs, then every graph in it is glued together in a treelike fashion from graphs that can almost be embedded in a fixed surface. We describe the precise formulation of the main results and survey some of its applications to algorithmic and structural problems in graph theory.
Graph and map isomorphism and all polyhedral embeddings in linear time
 IN PROCEEDINGS OF THE 40TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC
, 2008
"... For every surface S (orientable or nonorientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of facewidth at least 3 into S. This improves a previously known algorithm whose time complexity is n O(g), where g is the genus of S. Th ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
For every surface S (orientable or nonorientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of facewidth at least 3 into S. This improves a previously known algorithm whose time complexity is n O(g), where g is the genus of S. This is the first algorithm for which the degree of polynomial in the time complexity does not depend on g. The above result is based on two linear time algorithms, each of which solves a problem that is of independent interest. The first of these problems is the following one. Let S be a fixed surface. Given a graph G and an integer k≥3, we want to find an embedding of G in S of face width at least k, or conclude that such an embedding does not exist. It is known that this problem is NPhard when the surface is not fixed. Moreover, if there is an embedding, the algorithm can give all embeddings of facewidth at least k, up to Whitney equivalence. Here, the facewidth of an embedded graph G is the minimum number of points of G in which some noncontractible closed curve in the surface intersects the graph. In the proof of the above algorithm, we give a simpler proof and a better bound for the theorem by Mohar and Robertson concerning the number of polyhedral embeddings of 3connected graphs.
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
 in Proceedings of the thirtysixth annual ACM symposium on Theory of computing, ACM
, 2004
"... Abstract. In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [13] that one can find asymptotically optimal separators on these graphs if he is given both the graph an ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Abstract. In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [13] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embedding of it onto a low genus surface. Does there exist a simple, efficient algorithm to find these separators given only the graph and not the embedding? 2. In practice, spectral partitioning heuristics work extremely well on these graphs. Is there a theoretical reason why this should be the case? We resolve these two questions by showing that a simple spectral algorithm finds separators of cut ratio O ( p g/n) and vertex bisectors of size O ( √ gn) in these graphs, both of which are optimal. As our main technical lemma, we prove an O(g/n) bound on the second smallest eigenvalue of the Laplacian of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces. 1. Introduction. Spectral
Homology flows, cohomology cuts
 ACM SYMPOSIUM ON THEORY OF COMPUTING
, 2009
"... We describe the first algorithms to compute maximum flows in surfaceembedded graphs in nearlinear time. Specifically, given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, we can compute a maximum (s, t)flow in O(g 7 n log 2 n log 2 C) time fo ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
We describe the first algorithms to compute maximum flows in surfaceembedded graphs in nearlinear time. Specifically, given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, we can compute a maximum (s, t)flow in O(g 7 n log 2 n log 2 C) time for integer capacities that sum to C, or in (g log n) O(g) n time for real capacities. Except for the special case of planar graphs, for which an O(n log n)time algorithm has been known for 20 years, the best previous time bounds for maximum flows in surfaceembedded graphs follow from algorithms for general sparse graphs. Our key insight is to optimize the relative homology class of the flow, rather than directly optimizing the flow itself. A dual formulation of our algorithm computes the minimumcost cycle or circulation in a given (real or integer) homology class.
LinearTime Compression of BoundedGenus Graphs into InformationTheoretically Optimal Number of Bits
, 2002
"... ..."
Polynomialtime approximation schemes for subsetconnectivity problems in boundedgenus graphs
 In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science
, 2009
"... Abstract. We present the first polynomialtime approximation schemes (PTASes) for the following subsetconnectivity problems in edgeweighted graphs of bounded genus: Steiner tree, lowconnectivity survivablenetwork design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on b ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Abstract. We present the first polynomialtime approximation schemes (PTASes) for the following subsetconnectivity problems in edgeweighted graphs of bounded genus: Steiner tree, lowconnectivity survivablenetwork design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, and Mathieu [BMK07, Kle06] from planar graphs to boundedgenus graphs: any future problems shown to admit the required structure theorem for planar graphs will similarly extend to boundedgenus graphs. 1.
The crossing number of a projective graph is quadratic in the facewidth
 ELECTRON J. COMBIN
, 2008
"... ..."
Embedding graphs containing K5subdivisions
 Ars Combinatoria
"... Given a nonplanar graph G with a subdivision of K5 as a subgraph, we can either transform the K5subdivision into a K3,3subdivision if it is possible, or else we obtain a partition of the vertices of G\K5 into equivalence classes. As a result, we can reduce a projective planarity or toroidality al ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Given a nonplanar graph G with a subdivision of K5 as a subgraph, we can either transform the K5subdivision into a K3,3subdivision if it is possible, or else we obtain a partition of the vertices of G\K5 into equivalence classes. As a result, we can reduce a projective planarity or toroidality algorithm to a small constant number of simple planarity checks [6] or to a K3,3subdivision in the graph G. It significantly simplifies algorithms presented in [7], [10] and [12]. We then need to consider only the embeddings on the given surface of a K3,3subdivision, which are much less numerous than those of K5. 1.
A new NCalgorithm for finding a perfect matching in bipartite planar and small genus graphs (Extended Abstract)
, 2000
"... It has been known for a long time now that the problem of counting the number of perfect matchings in a planar graph is in NC. This result is based on the notion of a pfaffian orientation of a graph. (Recently, Galluccio and Loebl [7] gave a Ptime algorithm for the case of graphs of small genus.) H ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
It has been known for a long time now that the problem of counting the number of perfect matchings in a planar graph is in NC. This result is based on the notion of a pfaffian orientation of a graph. (Recently, Galluccio and Loebl [7] gave a Ptime algorithm for the case of graphs of small genus.) However, it is not known if the corresponding search problem, that of finding one perfect matching in a planar graph, is in NC. This situation is intriguing as it seems to contradict our intuition that search should be easier than counting. For the case of planar bipartite graphs, Miller and Naor [22] showed that a perfect matching can indeed be found using an NC algorithm. We present a very different NCalgorithm for this problem. Unlike the Miller...