An Atlas of Edge-Reversal Dynamics
Series: Chapman & Hall/CRC Research Notes in Mathematics Series; 421;
- Publisher's listprice GBP 180.00
-
91 098 Ft (86 760 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 18 220 Ft off)
- Discounted price 72 878 Ft (69 408 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
91 098 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1
- Publisher Chapman and Hall
- Date of Publication 23 August 2000
- ISBN 9781584882091
- Binding Paperback
- No. of pages380 pages
- Size 234x156 mm
- Weight 710 g
- Language English
- Illustrations 21 Tables, black & white 0
Categories
Short description:
This important resource offers the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal),. In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph classes, and gives an overview of the algorithmic aspects of the construction of the catalogue. Part 2: The Atlas comprises the atlas proper-a catalogue of graphical representations of all basins of attraction generated by the SER mechanism for all graphs in selected classes.
MoreLong description:
An Atlas Of Edge-Reversal Dynamics is the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal), a powerful distributed mechanism for scheduling agents in a computer system. The study of SER draws on strong motivation from several areas of application, and reveals very clearly the emergence of complex dynamic behavior from very simple transition rules. As such, SER provides the opportunity for the study of complex graph dynamics that can be applied to computer science, optimization, artificial intelligence, networks of automata, and other complex systems.
In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph classes, and gives an overview of the algorithmic aspects of the construction of the catalogue, thus summarizing the methodology and findings of the cataloguing effort. Part 2: The Atlas, comprises the atlas proper-a catalogue of graphical representations of all basins of attraction generated by the SER mechanism for all graphs in selected classes.
An Atlas Of Edge-Reversal Dynamics is a unique and detailed treatment of SER. Along with the catalogue, discussions of SER in the contexts of resource-sharing and automaton networks and a comprehensive set of references make this an important resource for researchers and graduate students in graph theory, discrete mathematics, and complex systems.
Table of Contents:
EDGE-REVERSAL DYNAMICS. Introduction. Neighborhood-Constrained Systems. Scheduling by Edge Reversal. The SER State Space. THE ATLAS. All Graphs on Six Nodes. All Trees on Seven Nodes. All Rings on up to Eight Nodes.
More
