Growing spanning trees in plasmodium machines
From MaRDI portal
Publication:3639316
DOI10.1108/03684920810851168zbMath1182.92001OpenAlexW2075542623MaRDI QIDQ3639316
Publication date: 30 October 2009
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03684920810851168
Developmental biology, pattern formation (92C15) Artificial intelligence for robotics (68T40) General biology and biomathematics (92B05)
Related Items
An adaptive and robust biological network based on the vacant-particle transportation model ⋮ If BZ medium did spanning trees these would be the same trees as \textit{Physarum} built ⋮ The nature of the extended analog computer ⋮ Programmable reconfiguration of Physarum machines ⋮ From reaction-diffusion to physarum computing
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The relative neighbourhood graph of a finite planar set
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- A Distributed Algorithm for Minimum-Weight Spanning Trees