Bipartite Grid Partitioning of a Random Geometric Graph

Abstract

We investigate the problem of efficient computation of a partition of a Random Geometric Graph (RGG) into a limited number of densely packed bipartite grid subgraphs. The study focuses on the collection of subgraphs each individually having similar size and structure and the union employing most (e.g. over 85%) of the vertices. The residual vertices we seek… (More)
DOI: 10.1109/DCOSS.2017.31

Topics

12 Figures and Tables

Slides referencing similar topics