16 research outputs found
Crossing Patterns in Nonplanar Road Networks
We define the crossing graph of a given embedded graph (such as a road
network) to be a graph with a vertex for each edge of the embedding, with two
crossing graph vertices adjacent when the corresponding two edges of the
embedding cross each other. In this paper, we study the sparsity properties of
crossing graphs of real-world road networks. We show that, in large road
networks (the Urban Road Network Dataset), the crossing graphs have connected
components that are primarily trees, and that the remaining non-tree components
are typically sparse (technically, that they have bounded degeneracy). We prove
theoretically that when an embedded graph has a sparse crossing graph, it has
other desirable properties that lead to fast algorithms for shortest paths and
other algorithms important in geographic information systems. Notably, these
graphs have polynomial expansion, meaning that they and all their subgraphs
have small separators.Comment: 9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL
International Conference on Advances in Geographic Information Systems(ACM
SIGSPATIAL 2017
On the Edge Crossings of the Greedy Spanner
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by considering pairs of points in order by distance, and connecting a pair by an edge when there does not already exist a path connecting that pair with length at most t times the Euclidean distance. We prove that, for any t > 1, these graphs have at most a linear number of crossings, and more strongly that the intersection graph of edges in a greedy t-spanner has bounded degeneracy. As a consequence, we prove a separator theorem for greedy spanners: any k-vertex subgraph of a greedy spanner can be partitioned into sub-subgraphs of size a constant fraction smaller, by the removal of O(?k) vertices. A recursive separator hierarchy for these graphs can be constructed from their planarizations in linear time, or in near-linear time if the planarization is unknown
Graph Theoretical Modelling of Electrical Distribution Grids
This thesis deals with the applications of graph theory towards the electrical distribution networks that transmit electricity from the generators that produce it and the consumers that use it. Specifically, we establish the substation and bus network as graph theoretical models for this major piece of electrical infrastructure. We also generate substation and bus networks for a wide range of existing data from both synthetic and real grids and show several properties of these graphs, such as density, degeneracy, and planarity. We also motivate future research into the definition of a graph family containing bus and substation networks and the classification of that family as having polynomial expansion
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We use it to construct the greedy multi-fragment tour for Euclidean TSP in O(n log n) time in any fixed dimension and for Steiner TSP in planar graphs in O(n sqrt(n)log n) time; we compute motorcycle graphs, a central step in straight skeleton algorithms, in O(n^(4/3+epsilon)) time for any epsilon>0
Distributed Construction of Lightweight Spanners for Unit Ball Graphs
Resolving an open question from 2006 [Damian et al., 2006], we prove the existence of light-weight bounded-degree spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple ?(log^*n)-round distributed algorithm in the LOCAL model of computation, that given a unit ball graph G with n vertices and a positive constant ? < 1 finds a (1+?)-spanner with constant bounds on its maximum degree and its lightness using only 2-hop neighborhood information. This immediately improves the best prior lightness bound, the algorithm of Damian, Pandit, and Pemmaraju [Damian et al., 2006], which runs in ?(log^*n) rounds in the LOCAL model, but has a ?(log ?) bound on its lightness, where ? is the ratio of the length of the longest edge to the length of the shortest edge in the unit ball graph. Next, we adjust our algorithm to work in the CONGEST model, without changing its round complexity, hence proposing the first spanner construction for unit ball graphs in the CONGEST model of computation. We further study the problem in the two dimensional Euclidean plane and we provide a construction with similar properties that has a constant average number of edge intersections per node. Lastly, we provide experimental results that confirm our theoretical bounds, and show an efficient performance from our distributed algorithm compared to the best known centralized construction
Product structure of graph classes with strongly sublinear separators
We investigate the product structure of hereditary graph classes admitting
strongly sublinear separators. We characterise such classes as subgraphs of the
strong product of a star and a complete graph of strongly sublinear size. In a
more precise result, we show that if any hereditary graph class
admits separators, then for any fixed
every -vertex graph in is a subgraph
of the strong product of a graph with bounded tree-depth and a complete
graph of size . This result holds with if
we allow to have tree-depth . Moreover, using extensions of
classical isoperimetric inequalties for grids graphs, we show the dependence on
in our results and the above bound are
both best possible. We prove that -vertex graphs of bounded treewidth are
subgraphs of the product of a graph with tree-depth and a complete graph of
size , which is best possible. Finally, we investigate the
conjecture that for any hereditary graph class that admits
separators, every -vertex graph in is a
subgraph of the strong product of a graph with bounded tree-width and a
complete graph of size . We prove this for various classes
of interest.Comment: v2: added bad news subsection; v3: removed section "Polynomial
Expansion Classes" which had an error, added section "Lower Bounds", and
added a new author; v4: minor revisions and corrections
Optimal Spanners for Unit Ball Graphs in Doubling Metrics
Resolving an open question from 2006, we prove the existence of light-weight
bounded-degree spanners for unit ball graphs in the metrics of bounded doubling
dimension, and we design a simple -round distributed
algorithm in the LOCAL model of computation, that given a unit ball graph
with vertices and a positive constant finds a
-spanner with constant bounds on its maximum degree and its
lightness using only 2-hop neighborhood information. This immediately improves
the best prior lightness bound, the algorithm of Damian, Pandit, and Pemmaraju,
which runs in rounds in the LOCAL model, but has a
bound on its lightness, where is the ratio
of the length of the longest edge to the length of the shortest edge in the
unit ball graph. Next, we adjust our algorithm to work in the CONGEST model,
without changing its round complexity, hence proposing the first spanner
construction for unit ball graphs in the CONGEST model of computation. We
further study the problem in the two dimensional Euclidean plane and we provide
a construction with similar properties that has a constant average number of
edge intersections per node. Lastly, we provide experimental results that
confirm our theoretical bounds, and show an efficient performance from our
distributed algorithm compared to the best known centralized construction