Rezumat articol ediţie STUDIA UNIVERSITATIS BABE┼×-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.1 din 2003  
         
  Articol:   BRIGITTE CHAUVIN, PHILIPPE FLAJOLET, DANIELE GARDY, ABDELKADER MOKKADEM EDS., MATHEMATICS AND COMPUTER SCIENCE II: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES", BIRKH─USER VERLAG, BASEL-BOSTON-BERLIN, 2002, ISBN 3-7643-6933-7, 557 PAGES.

Autori:  HORIA F. POP.
 
       
         
  Rezumat:  This book features a collection of original papers situated at the cross-roads of Mathematics and Computer Science, representing the Proceedings of the Interna- tional Colloquium of Mathematics and Computer Science, held at the University of Versailles-St-Quentin, in September 18{20, 2002. The issue is centered around topics of large interest, as Combinatorics, Random Graphs and Networks, Al- gorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The book has 557 pages, and provides 34 papers written by 60 authors, distributed among five distinct chapters of mathematics and computer science. Combinatorics is the starting point of many researches of discrete models. A few important results are presented, concerning map colouring problems, a theory of walks, ECO-systems, planar maps. Ramdon Graphcs and Networks have been the subject of intense study for fourty years. A few results concern an analysis of triangle-free graphs on breadth-first search, random maps and random graphs, colouring random graphs, aproximabil- ity of paths colouring problems, monimal spanning trees.  
         
     
         
         
      Revenire la pagina precedentă