{"title":"Andreas Brandstdt","description":null,"products":[{"product_id":"graph-theoretic-concepts-in-computer-science-book-andreas-brandstdt-9783540427070","title":"Graph-Theoretic Concepts in Computer Science","description":"This text of the refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, provides a wealth of contemporary results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52355308847377,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52355312353553,"sku":"NLS9783540427070","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540427070.jpg?v=1786791327"},{"product_id":"graphen-und-algorithmen-book-andreas-brandstdt-9783519021315","title":"Graphen und Algorithmen","description":"Graphen sind ein sehr haufig benutztes Modell bei der Beschreibung vielfaltiger struk- tureller Zusammenhange, so z. B. zur Informationsubertragung in Kommunikations- netzwerken, zum Transport von Waren oder zur Beschreibung hierarchischer Struktu- ren. Die Behandlung dieser Modelle mit den Mitteln der algorithmischen Graphentheorie stellt ein wichtiges Teilgebiet der Mathematik und Informatik dar. Das vorliegende Lehrbuch vermittelt eine Einfuhrung in dieses sich rasch entwickelnde Forschungsgebiet, wobei lediglich einfache Grundkenntnisse in Mathematik und Infor- matik vorausgesetzt werden, die i. a. im Grundstudium erworben werden. Zum Thema Graphen und Algorithmen gibt es bereits einige Lehrbucher, insbeson- dere in englischer Sprache. Da das Entwicklungstempo in dem ausgewahlten Gebiet jedoch sehr hoch ist, erscheint es sinnvoll, von Zeit zu Zeit die Darstellung klassischer Gebiete durch die Darstellung ausgewahlter Spezialgebiete zu erganzen. Dies geschieht in dem vorliegenden Lehrbuch. Die ersten Kapitel sind klassischen Gebieten gewidmet: - Euler- und Hamiltonkreise - Durchsuchen von Graphen - Minimalgeruste, greedy-Algorithmus und Matroide - Kurzeste Wege - Maximalflu in Netzwerken - Unabhangige Knoten- und Kantenmengen (Farbungen, matchings) Die letzten beiden Kapitel beschreiben neuere Ergebnisse aus den 80er und 90er Jah- ren, die in Lehrbuchform noch nicht erschienen sind und einen zentralen Aspekt der algorithmischen Graphentheorie darstellen, namlich - Graphen und Hypergraphen mit Baumstruktur (die eine Verallgemeinerung von Baumen darstellen) sowie - algorithmischer Nutzen dieser Strukturen 6 Im Unterschied zu bereits vorhandenen Lehrbuchern werden mehr die Struktureigen- schaften von Graphen, die oftmals die Grundlage der Effizienz von Algorithmen bilden, und weniger die begleitenden Datenstrukturen der Algorithmen betont.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52429230735633,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52429231390993,"sku":"NLS9783519021315","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783519021315.jpg?v=1786441685"},{"product_id":"graph-theoretic-concepts-in-computer-science-book-andreas-brandstdt-9783540748380","title":"Graph-Theoretic Concepts in Computer Science","description":"The 33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007) took place in the Conference Center in old castleinDornburgnearJena, Germany, June21-23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Canada, the Czech Republic, France, UK, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the USA. WG 2007 continued the series of 32 previous WG conferences. Since 1975, the WG conference has taken place 20 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; 99 papers were submitted and in an evaluation process with four reports per submission, 30 papers were accepted by the Program Comm- tee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. There were invited talks by Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA assembly, and by Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52660485357841,"sku":"NLS9783540748380","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540748380.jpg?v=1791885605"}],"url":"https:\/\/www.worldofbooks.com\/collections\/author-books-by-andreas-brandstdt.oembed","provider":"World of Books ","version":"1.0","type":"link"}