Geometric Networks typically are a sparse subgraphs of a complete graph defined over a set of points embedded in the plane (or space). There are several algorithms which take a complete graph and compute a sparse subgraph satisfying various constraints, e.g. low diameter, constant degree and fault-tolerant. In our recent work, we have designed algorithms […]
Read More