Graph-Theoretic Concepts in Computer Science

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Hans L. Bodlaender 

I S B N：(纸本) 9783540204527 

出 版 社：Springer Berlin  Heidelberg 

出 版 年：1000年

页      数：XII, 392页

主 题 词：Theory of Computation Simulation and Modeling Algorithm Analysis and Problem Complexity Data Structures Numeric Computing Discrete Mathematics in Computer Science 

摘      要：The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The *** of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19–21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and ?ve di?erent continents. The workshop looks back at a long tradition. It was ?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in The Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computerscience,*** to the theoretical and practical aspects of graph concepts in computer science. The goal is to present recent research results and to identify and explore - rections of future research. The talks given at the workshop showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science.