A Separator Theorem for Graphs of Bounded Genus
Title | A Separator Theorem for Graphs of Bounded Genus PDF eBook |
Author | Cornell University. Department of Computer Science |
Publisher | |
Pages | 29 |
Release | 1982 |
Genre | |
ISBN |
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges whose removal divides the graph roughly in half. Most graphs do not have the necessary small separators, but some useful classes do. One such class is planar graphs: If we can draw an n-vertex graph on the plane, then we can bisect it by removing $O(\sqrt{n})$ vertices [Lipt79b].
Separators in High-genus Near-planar Graphs
Title | Separators in High-genus Near-planar Graphs PDF eBook |
Author | Juraj Culak |
Publisher | |
Pages | 90 |
Release | 2016 |
Genre | Graph theory |
ISBN |
"Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in arbitrary planar graphs and other graphs with less restricted structure. This work explores planar separators and the planar separator theorem, as well as the existence of separators in the class of high genus near-planar graphs. These graphs have unbounded genus, where additionally the edges that cross each other are located near each other in the graph. Several different graph classes that are high genus near-planar graphs are investigated for their feasibility for an extended separator theorem result."--Abstract.
Algorithms and Data Structures
Title | Algorithms and Data Structures PDF eBook |
Author | Faith Ellen |
Publisher | Springer |
Pages | 613 |
Release | 2017-07-04 |
Genre | Computers |
ISBN | 3319621270 |
This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures
A Separation Theorem for Graphs of Bounded Genus
Title | A Separation Theorem for Graphs of Bounded Genus PDF eBook |
Author | John R. Gilbert |
Publisher | |
Pages | 29 |
Release | 1982 |
Genre | |
ISBN |
Algorithm Theory - SWAT 2000
Title | Algorithm Theory - SWAT 2000 PDF eBook |
Author | Magnús M. Halldórsson |
Publisher | Springer Science & Business Media |
Pages | 578 |
Release | 2000-06-21 |
Genre | Computers |
ISBN | 3540676902 |
This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000. The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The papers are organized in sections on data structures, dynamic partitions, graph algorithms, online algorithms, approximation algorithms, matchings, network design, computational geometry, strings and algorithm engineering, external memory algorithms, optimization, and distributed and fault-tolerant computing.
Sparsity
Title | Sparsity PDF eBook |
Author | Jaroslav Nešetřil |
Publisher | Springer Science & Business Media |
Pages | 472 |
Release | 2012-04-24 |
Genre | Mathematics |
ISBN | 3642278752 |
This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Nešetřil is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010.
Graphs on Surfaces
Title | Graphs on Surfaces PDF eBook |
Author | Bojan Mohar |
Publisher | Johns Hopkins University Press |
Pages | 0 |
Release | 2001-08-02 |
Genre | Mathematics |
ISBN | 9780801866890 |
Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous four-color theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of course, the internet. In this new book in the Johns Hopkins Studies in the Mathematical Science series, Bojan Mohar and Carsten Thomassen look at a relatively new area of graph theory: that associated with curved surfaces. Graphs on surfaces form a natural link between discrete and continuous mathematics. The book provides a rigorous and concise introduction to graphs on surfaces and surveys some of the recent developments in this area. Among the basic results discussed are Kuratowski's theorem and other planarity criteria, the Jordan Curve Theorem and some of its extensions, the classification of surfaces, and the Heffter-Edmonds-Ringel rotation principle, which makes it possible to treat graphs on surfaces in a purely combinatorial way. The genus of a graph, contractability of cycles, edge-width, and face-width are treated purely combinatorially, and several results related to these concepts are included. The extension by Robertson and Seymour of Kuratowski's theorem to higher surfaces is discussed in detail, and a shorter proof is presented. The book concludes with a survey of recent developments on coloring graphs on surfaces.