Kategoria BISAC: Mathematics >> Graphic Methods

This book covers different, though related, aspects of the field: the generation of quality grids for complex three-dimensional geometries; parallel mesh generation algorithms; mesh adaptation, including both theoretical and implementation aspects;...

Handbook of Product Graphs, Second Edition examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, the handbook presents full proofs of many important results as well as up-to-date research and conjectures.

Results and Algorithms New to the Second Edition:

• Cancellation results
• A quadratic...

The emerging field of computational social science (CSS) is devoted to the pursuit of interdisciplinary social science research from an information processing perspective, through the medium of advanced computing and information technologies.

This reader-friendly textbook/reference is the first work of its kind to provide a comprehensive and unified Introduction to Computational Social Science. Four distinct methodological approaches are examined in particular detail, namely automated social information extraction, social network analysis, social complexity theory, and social...

This book takes a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. The authors' unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic preliminaries of hypergraph theory in general, and develop two hypergraph based polynomial algorithms, i.e., hypergraph coloring and hypergraph clustering. Then, in Chaps. 2 and 3, the authors present two emerging applications of hypergraph coloring and hypergraph clustering in Device-to-Device (D2D) underlay communication networks, respectively, in...