Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of neurology 202 (1972), S. 209-216 
    ISSN: 1432-1459
    Keywords: Polyneuropathy in Lead Intoxication ; Lead Polyneuropathy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Description / Table of Contents: Zusammenfassung Klinische, elektrophysiologische und nervenbioptische Untersuchungen eines Patienten mit einer schweren Bleipolyneuropathie zeigten, daß die chronische Bleiintoxikation hauptsächlich eine axonale Degeneration der peripheren Nerven bewirkte, dagegen nur eine leichte segmentale Demyelinisierung; das periphere motorische Neuron war weitaus schwerer als das sensible betroffen.
    Notes: Summary Clinical and electrophysiological investigations and a sural nerve biopsy in a patient with chronic lead poisoning showed that the severe neuropathy was mainly due to axonal degeneration, while segmental demyelination was only slight; the lower motor neuron was much more affected than the primary sensory neuron.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 10 (1990), S. 41-51 
    ISSN: 1439-6912
    Keywords: 05C10 ; 05C35 ; 68E10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Answering a question of Rosenstiehl and Tarjan, we show that every plane graph withn vertices has a Fáry embedding (i.e., straight-line embedding) on the 2n−4 byn−2 grid and provide anO(n) space,O(n logn) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any setF, which can support a Fáry embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...