BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Dynamical Systems, Graphs, and Algorithms

Dynamical Systems, Graphs, and Algorithms

Dynamical Systems, Graphs, and Algorithms Paperback - 2006

by George Osipenko

Add to wish list
  • New
  • Paperback
New

Description

Paperback. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; N/A
Ask the seller a question Add to wish list
A$95.99
A$15.46 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

  • Title Dynamical Systems, Graphs, and Algorithms
  • Author George Osipenko
  • Binding Paperback
  • Edition 1st
  • Condition New
  • Pages 288
  • Volumes 1
  • Language ENG
  • Publisher Springer, Berlin
  • Publication date 2006-11-06
  • Illustrated Yes
  • Features Illustrated, Index, Table of Contents
  • Bookseller's Inventory # ria9783540355939_inp
  • ISBN 9783540355939 / 3540355936
  • Weight 0.96 lbs (0.44 kg)
  • Dimensions 9.28 x 6.28 x 0.46 in (23.57 x 15.95 x 1.17 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 2006930097
  • Dewey Decimal Code 515.39
  • Quantity available 989

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Dynamical Systems, Graphs, and Algorithms

From the publisher

This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions. The method is used, among other things, to locate the periodic orbits and the chain recurrent set, to construct the attractors and their basins, to estimate the entropy, and more.

tracking-