We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...