Graph-Theoretic Concepts in Computer Science
Subtitle: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: November 18, 1997
Language: eng
Format: Paperback
Number of pages: 376
ISBN-13: 9783540637578
Subjects: Mathematical theory of computation; Computer Science; Discrete Mathematics; Computers / Computer Science; Graph-algorithms; Graph-operations; Graph-theory; combinatorial optimization; networking-algorithms; Mathematics; Computers - General Information
First sentence: Local search is a general technique that is extensively used to solve difficult combinatorial optimization problems.
Description: This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.