We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
— Relaying diversity is a key technology to increase capacity in wireless networks. In this paper, the capacity of a single source-destination wireless channel, aided by a set of...
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...