Results 1  10
of
20,211
On the Minimum Number of
"... A family P = {π1,..., πq} of permutations of [n] = {1,..., n} is completely kscrambling [Spencer, 1972; Füredi, 1996] if for any distinct k points x1,..., xk ∈ [n], permutations πi’s in P produce all k! possible orders on πi(x1),..., πi(xk). Let N ∗ (n, k) be the minimum size of such a family. Thi ..."
Abstract
 Add to MetaCart
A family P = {π1,..., πq} of permutations of [n] = {1,..., n} is completely kscrambling [Spencer, 1972; Füredi, 1996] if for any distinct k points x1,..., xk ∈ [n], permutations πi’s in P produce all k! possible orders on πi(x1),..., πi(xk). Let N ∗ (n, k) be the minimum size of such a family
The Minimum Number of Monotone Subsequences
, 2002
"... Erdos and Szekeres showed that any permutation of length n +1contains a monotone subsequence of length k + 1. A simple example shows that there need be no more than (n mod k) such subsequences; we conjecture that this is the minimum number of such subsequences. We prove this fo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Erdos and Szekeres showed that any permutation of length n +1contains a monotone subsequence of length k + 1. A simple example shows that there need be no more than (n mod k) such subsequences; we conjecture that this is the minimum number of such subsequences. We prove
The Minimum Number of Hubs in Networks
"... In this paper, a hub refers to a nonterminal vertex of degree at least three. We study the minimum number of hubs needed in a network to guarantee certain flow demand constraints imposed between multiple pairs of sources and sinks. We prove that under the constraints, regardless of the size or the ..."
Abstract
 Add to MetaCart
In this paper, a hub refers to a nonterminal vertex of degree at least three. We study the minimum number of hubs needed in a network to guarantee certain flow demand constraints imposed between multiple pairs of sources and sinks. We prove that under the constraints, regardless of the size
ROUTING WITH MINIMUM NUMBER OF LANDMARKS
"... Routing problem has been studied for decades. In this paper, we focus on one of the routing problems: finding a path from source to destination on road network with the guidance of landmarks. People use landmarks to identify previously visited places and reoriented themselves in the environment. Whe ..."
Abstract
 Add to MetaCart
at least one landmark to be seen at any point along the way. Therefore, the problem becomes: find a path P from s to t such that the driver can see at least one landmark at any point along P and the number of landmarks the driver can stick to is minimized. There are two cases: (a) The same landmark
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract

Cited by 749 (0 self)
 Add to MetaCart
We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
MerrifieldSimmons index and minimum Number of Independent Sets
"... MerrifieldSimmons index and minimum number of independent sets in short trees by ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
MerrifieldSimmons index and minimum number of independent sets in short trees by
MINIMUM NUMBER OF DISTINCT EIGENVALUES OF GRAPHS
, 2013
"... The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to deduce further properties of q(G). It is shown that there is a great number of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to deduce further properties of q(G). It is shown that there is a great number
The minimum number of nonnegative edges in hypergraphs
 Electron. J. Combin
, 2014
"... Abstract An runform nvertex hypergraph H is said to have the ManickamMiklósSinghi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the minimum degree of H. In this paper we show that for n & ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract An runform nvertex hypergraph H is said to have the ManickamMiklósSinghi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the minimum degree of H. In this paper we show that for n
Results 1  10
of
20,211