You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the thoroughly refereed post-proceedings of the 9th International Symposium on Graph Drawing, GD 2001, held in Vienna, Austria, in September 2001. The 32 revised full papers presented were carefully reviewed and selected from 66 paper submissions. Also included are a corrected version of a paper from the predecessor volume, short reports on the software systems exhibition, two papers of the special session on graph exchange formats, and a report on the annual graph drawing contests. The papers are organized in topical sections on hierarchical drawing, planarity, crossing theory, compaction, planar graphs, symmetries, interactive drawing, representations, aesthetics, 2D- and 3D-embeddings, data visualization, floor planning, and planar drawing.
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing on which application programs can be built. In each of the core computer science areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library; it is written in C++ and is available on many types of machine. Whilst the software is freely available worldwide and is installed at hundreds of sites, this is the first book devoted to the library. Written by the main authors of LEDA, it is the definitive account, describing how the system is constructed and operates and how it can be used. The authors supply ample examples from a range of areas to show how the library can be used in practice, making the book essential for all workers in algorithms, data structures and computational geometry.
This book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany in September 2006. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers and a report on the graph drawing contest were carefully selected during two rounds of reviewing and improvement from 91 submissions. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fie.
This book constitutes the refereed proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005, held in Palma de Mallorca, Spain, in September 2005 in the context of the combined conference ALGO 2005. The 75 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 244 submissions. The papers address all current issues in algorithmics reaching from design and mathematical issues over real-world applications in various fields up to engineering and analysis of algorithms.
Artificial Intelligence in Economics and Managemetn to Requirements Engineering
A state-of-the-art survey that reports on the progress made in selected areas of this important and growing field, aiding the analysis of existing networks and the design of new and more efficient algorithms for solving various problems on these networks.
This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007. The 30 revised full papers presented together with three invited talks cover the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms.
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering. Each chapter is self-contained and includes extensive references. The first several chapters of the book deal with fundamental topological and geometric concepts and techniques used in graph drawing, such as planarity testing and embedding, crossings and planarization, symmetric drawings, and proximity drawings. The following...
After long years of work that have seen little industrial application, high-level synthesis is finally on the verge of becoming a practical tool. The state of high-level synthesis today is similar to the state of logic synthesis ten years ago. At present, logic-synthesis tools are widely used in digital system design. In the future, high-level synthesis will play a key role in mastering design complexity and in truly exploiting the potential of ASIes and PLDs, which demand extremely short design cycles. Work on high-level synthesis began over twenty years ago. Since substantial progress has been made in understanding the basic then, problems involved, although no single universally-accepted ...