Hasil Pencarian  ::  Simpan CSV :: Kembali

"A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees."

"This book focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. This book examines applications for solving the traveling salesman problem and its variations, maximum weight independent set problem, different classes of allocation and cluster analysis as well as some classes of scheduling problems. Data correcting algorithms in combinatorial optimization introduces the data correcting approach to algorithms which provide an answer to the following questions, how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.​"

"This volume constitutes the refereed proceedings of the 15th International Workshop on Combinatorial Image Analysis, IWCIA 2012, held in Austin, TX, USA in November 2012. The 23 revised full papers presented were carefully reviewed and selected from numerous submissions. The topics covered include digital geometry, combinatorics in digital spaces, digital curves and surfaces; digital topologyl grammars, transformation, applications; grammars and models in image analysis; picture transformations, morphologic operations, image segmentation; and discrete tomography, applications"