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
Stock photo: cover may vary

Dynamical Systems, Graphs, and Algorithms Paperback - 2006

by Osipenko, George,

Add to wish list
  • New
New

Description

new.
Ask the seller a question Add to wish list
A$94.76
A$5.77 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)

Details

  • Title Dynamical Systems, Graphs, and Algorithms
  • Author Osipenko, George,
  • 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 # 4403920-n
  • 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 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

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 GreatBookPrices

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-