Advances in Multiresolution for Geometric Modelling (Mathematics and Visualization)
Multiresolution methods in geometric modelling are concerned with the generation, representation, and manipulation of geometric objects at several levels of detail. Applications include fast visualization and rendering as well as coding, compression, and digital transmission of 3D geometric objects. This book marks the culmination of the four-year EU-funded research project, Multiresolution in Geometric Modelling (MINGLE). The book contains seven survey papers, providing a detailed overview of r...
This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heuberger's result on the energy of trees, the energy of random graphs or the approach to energy using singular values. It contains an extensive coverage of recent results and a gradual development of topics and the inclusion of complete proofs from most of the important recent results in the a...
From Domination to Coloring (SpringerBriefs in Mathematics)
by Gary Chartrand, Teresa W. Haynes, Michael A. Henning, and Ping Zhang
This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and probl...
Graph-Based Modelling in Science, Technology and Art (Mechanisms and Machine Science, #107)
This book presents interdisciplinary, cutting-edge and creative applications of graph theory and modeling in science, technology, architecture and art. Topics are divided into three parts: the first one examines mechanical problems related to gears, planetary gears and engineering installations; the second one explores graph-based methods applied to medical analyses as well as biological and chemical modeling; and the third part includes various topics e.g. drama analysis, aiding of design activ...
The discrete Fourier transform (DFT) is an extremely useful tool that finds application in many different disciplines. However, its use requires caution. The aim of this book is to explain the DFT and its various artifacts and pitfalls and to show how to avoid these (whenever possible), or at least how to recognize them in order to avoid misinterpretations. This concentrated treatment of the DFT artifacts and pitfalls in a single volume is, indeed, new, and it makes this book a valuable source o...
Extremal Graph Theory (London Mathematical Society Monographs) (Dover Books on Mathematics)
by Bela Bollobas
This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, kno...
Topics in Graph Theory
by Wilfried Imrich, Sandi Klavzar, and Douglas F Rall
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way,
Well-Quasi Orders in Computation, Logic, Language and Reasoning (Trends in Logic, #53)
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have...
Algebraic Combinatorics (Undergraduate Texts in Mathematics)
by Richard P. Stanley
Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author's extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound knowledge to mathematical, engineering,...
Construct, analyze, and visualize networks with networkx, a Python language module. Network analysis is a powerful tool you can apply to a multitude of datasets and situations. Discover how to work with all kinds of networks, including social, product, temporal, spatial, and semantic networks. Convert almost any real-world data into a complex network--such as recommendations on co-using cosmetic products, muddy hedge fund connections, and online friendships. Analyze and visualize the netwo...
Fete of Combinatorics and Computer Science (Bolyai Society Mathematical Studies, #20)
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in the...
Critiquing the Sacred Secular Divide. Accounting, Auditing & Accountability Journal, Volume 18, Issue 2.
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic tre...
Graph-Theoretic Concepts in Computer Science (Lecture Notes in Computer Science, #570)
This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, p...
Shape Interrogation for Computer Aided Design and Manufacturing
by Nicholas M. Patrikalakis and Takashi Maekawa
Shape interrogation is the process of extraction of information from a geometric model. It is a fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) systems. This book provides a bridge between the areas geometric modeling and solid modeling. Apart from the differential geometry topics covered, the entire book is based on the unifying concept of recasting all shape interrogation problems to the solution of a nonlinear system. It provides the mathematical fundamentals as wel...