Author : Howard Jeffrey Karloff
Publisher :
Page : 166 pages
File Size : 17,79 MB
Release : 1985
Category : Algorithms
ISBN :
Author :
Publisher :
Page : 888 pages
File Size : 16,88 MB
Release : 1986
Category : Combinatorial analysis
ISBN :
Author : Leonid Barenboim
Publisher : Morgan & Claypool Publishers
Page : 173 pages
File Size : 42,51 MB
Release : 2013-07-01
Category : Computers
ISBN : 1627050191
The objective of our monograph is to cover the developments on the theoretical foundations of distributed symmetry breaking in the message-passing model. We hope that our monograph will stimulate further progress in this exciting area.
Author :
Publisher :
Page : 592 pages
File Size : 34,91 MB
Release : 1970
Category : Combinatorial analysis
ISBN :
Author : Marek Karpiński
Publisher : Oxford University Press
Page : 228 pages
File Size : 48,82 MB
Release : 1998
Category : Computers
ISBN : 9780198501626
The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for students at the beginning graduate level, the exposition is largely self-contained and example-driven; prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and will be of interest to researchers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are presented in three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the goals of the book is to show how these three approaches can be combined to develop efficient parallel algorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas.
Author : Edward R. Scheinerman
Publisher : Courier Corporation
Page : 242 pages
File Size : 43,60 MB
Release : 2013-04-29
Category : Mathematics
ISBN : 0486292134
This volume explains the general theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics: fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, fractional isomorphism, and more. 1997 edition.
Author : Lasse Kliemann
Publisher : Springer
Page : 428 pages
File Size : 35,6 MB
Release : 2016-11-10
Category : Computers
ISBN : 3319494872
Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.
Author : Tommy R. Jensen
Publisher : John Wiley & Sons
Page : 320 pages
File Size : 12,50 MB
Release : 2011-10-24
Category : Mathematics
ISBN : 1118030745
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Author : David A. Bader
Publisher : American Mathematical Soc.
Page : 258 pages
File Size : 41,94 MB
Release : 2013-03-18
Category : Mathematics
ISBN : 0821890387
Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: What are the communities within an (online) social network? How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer? How must components be organized on a computer chip such that they can communicate efficiently with each other? What are the segments of a digital image? Which functions are certain genes (most likely) responsible for? The 10th DIMACS Implementation Challenge Workshop was devoted to determining realistic performance of algorithms where worst case analysis is overly pessimistic and probabilistic models are too unrealistic. Articles in the volume describe and analyze various experimental data with the goal of getting insight into realistic algorithm performance in situations where analysis fails.
Author : Jan Leeuwen
Publisher : Springer Science & Business Media
Page : 633 pages
File Size : 14,84 MB
Release : 2000-07-26
Category : Computers
ISBN : 3540678239
This book constitutes the refereed proceedings of the International Conference IFIP TCS 2000 held in Sendai, Japan in August 2000. The 32 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 70 submissions. The papers are organized in two tracks on algorithms, complexity, and models of computation and on logics, semantics, specification, and verification. The book is devoted to exploring new frontiers of theoretical informatics and addresses all current topics in theoretical computer science.
