𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algebraic Foundation for Graph-based Diagrams in Computing

✍ Scribed by John Power; Konstantinos Tourlas

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
190 KB
Volume
45
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algebraic foundation for automatic fe
An algebraic foundation for automatic feature-based program synthesis
✍ Sven Apel; Christian Lengauer; Bernhard MΓΆller; Christian KΓ€stner πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 872 KB

Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along different lines of research, different notions of a feature have been developed. Although these notions have similar goals, no c

An Algorithm for Computing an Integral B
An Algorithm for Computing an Integral Basis in an Algebraic Function Field
✍ Mark van Hoeij πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 310 KB

Algorithms for computing integral bases of an algebraic function field are implemented in some computer algebra systems. They are used e.g. for the integration of algebraic functions. The method used by Maple 5.2 and AXIOM is given by Trager in [Trager,1984]. He adapted an algorithm of Ford and Zass

An SST-based algorithm for the steiner p
An SST-based algorithm for the steiner problem in graphs
✍ J. E. Beasley πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 644 KB

In this paper we consider the Steiner problem in graphs which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these addition