Growing spanning trees in plasmodium machines (Q3639316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1108/03684920810851168 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075542623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:07, 2 July 2024

scientific article
Language Label Description Also known as
English
Growing spanning trees in plasmodium machines
scientific article

    Statements

    Growing spanning trees in plasmodium machines (English)
    0 references
    0 references
    0 references
    30 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    cybernetics
    0 references
    nature inspired computing
    0 references
    plasmodium
    0 references
    proximity graphs
    0 references
    0 references