Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 24 of 30 found articles
 
 
  Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
 
 
Title: Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Author: Mazurkiewicz, Antoni
Appeared in: Fundamenta informaticae
Paging: Volume 75 (2007) nr. 1-4 pages 335-355
Year: 2007-03-06
Contents: In the paper a class of locally derivable graphs is defined and discussed. Well known particular cases of derivable graphs are (among others) trees, complete, and triangular graphs; in the paper a broader class of locally derivable graphs, called closed graphs, is defined. Nodes and edges of closed graphs can be partitioned into external and internal ones; the main property of such graphs their local reducibility: successive removing its external nodes leads eventually to a singleton, and removing its external edges leads to an a spanning tree of the graph. The class of closed graphs is then a class enabling structural reducing. This property can be applied in processor networks to design some local procedures leading to global results.
Publisher: IOS Press
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 24 of 30 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands