3652 search results - page 19 / 731 » A study of query length |
GC
2010
Springer
13 years 5 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
ACNS
2011
Springer
12 years 11 months ago
2011
Springer
It is a well known fact that encryption schemes cannot hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its p...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
QUESTA
2007
13 years 7 months ago
2007
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...