<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05853597</id>
  <dt>a</dt>
  <an>05853597</an>
  <augroup>
    <au>Mehlhorn, Kurt</au>
  </augroup>
  <ti>The Physarum computer.</ti>
  <so>Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18--20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 8 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-19094-0_3</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Physarum is a slime mold. It was observed over the past 10 years that the mold is able to solve shortest path problems and to construct good Steiner networks [2,4]. In a nutshell, the shortest path experiment is as follows: A maze is built and the mold is made to cover the entire maze. Food is then provided at two positions $s$ and $t$ and the evolution of the slime is observed. Over time, the slime retracts to the shortest $s-t$-path.</ab>
    <rv></rv>
  </abgroup>
</item>