Skip to content
Home/ Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, Usa, September 29 - October 1, 1986
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, Usa, September 29 - October 1, 1986

Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, Usa, September 29 - October 1, 1986

No customer reviews yet ISBN 9783540184201

This volume describes recent research in graph reduction and related areas of functional and logic programming, as reported at a workshop in 1986. The papers are based on the presentations, and because the final versions were prepared after the workshop, they reflect some of the discussions as well. Some benefits of graph reduction can be found in these papers: - A mathematically elegant denotational semantics - Lazy evaluation, which avoids recomputation and makes programming with infinite data structures (such as streams) possible - A natural tasking model for fine-to-medium grain parallelism. The major topics covered are computational models for graph reduction, implementation of graph reduction on conventional architectures, specialized graph reduction architectures, resource control issues such as control of reduction order and garbage collection, performance modelling and simulation, treatment of arrays, and the relationship of graph reduction to logic programming.

About the author

Product details

Pub dateOct 7, 1987
ISBN-103540184201
ISBN-139783540184201
LanguageEnglish
Last updated 2026-09-08 01:29
$57.47
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Mathematics | Graphic Methods
See all
Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches
<i> <p>Fixed Point Theory and Graph Theory</i> provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. </p> <p>This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. </p> <p>The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.</p>
$115.75
Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek
$219.75
Random Geometric Graphs
Penrose, Mathew
$219.75
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$214.27
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$110.03
Graph Decompositions: A Study in Infinite Graph Theory
Diestel, Reinhard
$100.15