The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2003  
         
  Article:   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.

Authors:  HORIA F. POP.
 
       
         
  Abstract:  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.  
         
     
         
         
      Back to previous page