5100 search results - page 145 / 1020 » The Linear Complexity of a Graph |
CCCG
2007
13 years 10 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
ALGORITHMICA
2002
13 years 9 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— For linear and hybrid systems, constrained timeoptimal control was shown to be a low complexity alternative to the explicit solution of the constrained finite-time-opt...
EUROCRYPT
2012
Springer
11 years 11 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— A method is presented to synthesize wideband linear-phase FIR filters with a piecewise-polynomial-sinusoidal impulse response. The proposed method is based on merging the earl...