We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...