John R. Gilbert – författare
Visar alla böcker från författaren John R. Gilbert. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
E-bok
PDF, Engelska, 20121 416 kr
Läs direkt efter köp
This book looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysis and theoretical computer scientists alike.
Del 56 - IMA Volumes in Mathematics and its Applications
Graph Theory and Sparse Matrix Computation
Häftad, Engelska, 2011
1 084 kr
Skickas inom 10-15 vardagar
This book looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysis and theoretical computer scientists alike.
SWAT '90
2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings
Häftad, Engelska, 1990
546 kr
Skickas inom 10-15 vardagar
This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.